./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-15/cstrcpy_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/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_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-15/cstrcpy_malloc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/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_6228eff5-2512-4191-8909-434d6aedbf59/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 b3793c1153138718c278bf2758234e75646fb19e62e98d110099399474912470 --- 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 15:53:16,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:53:16,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:53:16,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:53:16,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:53:16,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:53:16,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:53:16,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:53:16,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:53:16,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:53:16,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:53:16,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:53:16,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:53:16,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:53:16,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:53:16,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:53:16,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:53:16,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:53:16,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:53:16,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:53:16,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:53:16,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:53:16,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:53:16,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:53:16,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:53:16,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:53:16,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:53:16,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:53:16,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:53:16,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:53:16,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:53:16,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:53:16,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:53:16,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:53:16,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:53:16,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:53:16,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:53:16,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:53:16,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:53:16,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:53:16,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:53:16,963 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-12-14 15:53:16,978 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:53:16,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:53:16,978 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:53:16,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:53:16,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:53:16,979 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:53:16,979 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:53:16,979 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:53:16,979 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:53:16,979 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:53:16,979 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:53:16,979 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:53:16,979 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:53:16,980 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:53:16,980 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:53:16,980 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:53:16,980 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:53:16,980 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:53:16,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 15:53:16,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 15:53:16,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:53:16,981 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:53:16,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:53:16,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:53:16,981 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 15:53:16,981 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 15:53:16,981 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 15:53:16,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:53:16,982 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:53:16,982 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:53:16,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:53:16,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:53:16,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:53:16,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:53:16,982 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:53:16,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:53:16,983 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:53:16,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:53:16,983 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:53:16,983 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_6228eff5-2512-4191-8909-434d6aedbf59/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_6228eff5-2512-4191-8909-434d6aedbf59/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 -> b3793c1153138718c278bf2758234e75646fb19e62e98d110099399474912470 [2022-12-14 15:53:17,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:53:17,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:53:17,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:53:17,191 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:53:17,191 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:53:17,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/termination-15/cstrcpy_malloc.i [2022-12-14 15:53:19,745 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:53:19,928 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:53:19,928 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/sv-benchmarks/c/termination-15/cstrcpy_malloc.i [2022-12-14 15:53:19,936 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/data/23e490781/c1e8c2252abf4fdf8283378190608d06/FLAGbfbd2f53f [2022-12-14 15:53:20,341 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/data/23e490781/c1e8c2252abf4fdf8283378190608d06 [2022-12-14 15:53:20,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:53:20,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:53:20,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:53:20,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:53:20,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:53:20,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:53:20" (1/1) ... [2022-12-14 15:53:20,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4039499a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20, skipping insertion in model container [2022-12-14 15:53:20,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:53:20" (1/1) ... [2022-12-14 15:53:20,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:53:20,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:53:20,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:53:20,649 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:53:20,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:53:20,710 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:53:20,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20 WrapperNode [2022-12-14 15:53:20,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:53:20,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:53:20,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:53:20,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:53:20,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20" (1/1) ... [2022-12-14 15:53:20,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20" (1/1) ... [2022-12-14 15:53:20,747 INFO L138 Inliner]: procedures = 152, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-12-14 15:53:20,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:53:20,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:53:20,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:53:20,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:53:20,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20" (1/1) ... [2022-12-14 15:53:20,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20" (1/1) ... [2022-12-14 15:53:20,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20" (1/1) ... [2022-12-14 15:53:20,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20" (1/1) ... [2022-12-14 15:53:20,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20" (1/1) ... [2022-12-14 15:53:20,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20" (1/1) ... [2022-12-14 15:53:20,767 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20" (1/1) ... [2022-12-14 15:53:20,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20" (1/1) ... [2022-12-14 15:53:20,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:53:20,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:53:20,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:53:20,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:53:20,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20" (1/1) ... [2022-12-14 15:53:20,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:53:20,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:20,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:53:20,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:53:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 15:53:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 15:53:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 15:53:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:53:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:53:20,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:53:20,902 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:53:20,903 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:53:21,048 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:53:21,083 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:53:21,083 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 15:53:21,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:53:21 BoogieIcfgContainer [2022-12-14 15:53:21,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:53:21,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:53:21,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:53:21,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:53:21,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:53:20" (1/3) ... [2022-12-14 15:53:21,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e00ff73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:53:21, skipping insertion in model container [2022-12-14 15:53:21,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:20" (2/3) ... [2022-12-14 15:53:21,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e00ff73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:53:21, skipping insertion in model container [2022-12-14 15:53:21,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:53:21" (3/3) ... [2022-12-14 15:53:21,091 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy_malloc.i [2022-12-14 15:53:21,107 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:53:21,107 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-12-14 15:53:21,140 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:53:21,145 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2342b141, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:53:21,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-14 15:53:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 15 states have (on average 2.066666666666667) 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 15:53:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 15:53:21,153 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:21,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 15:53:21,154 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash 96686, now seen corresponding path program 1 times [2022-12-14 15:53:21,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:21,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573863559] [2022-12-14 15:53:21,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:21,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:21,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 15:53:21,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:21,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573863559] [2022-12-14 15:53:21,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573863559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:21,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:21,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:53:21,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013289928] [2022-12-14 15:53:21,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:21,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:21,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:21,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:21,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:21,328 INFO L87 Difference]: Start difference. First operand has 29 states, 15 states have (on average 2.066666666666667) 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:21,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:21,379 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-12-14 15:53:21,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:21,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 15:53:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:21,386 INFO L225 Difference]: With dead ends: 30 [2022-12-14 15:53:21,387 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 15:53:21,388 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 15:53:21,390 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:21,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 15:53:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-12-14 15:53:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-12-14 15:53:21,414 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 3 [2022-12-14 15:53:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:21,414 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-12-14 15:53:21,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-12-14 15:53:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 15:53:21,415 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:21,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 15:53:21,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:53:21,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 96710, now seen corresponding path program 1 times [2022-12-14 15:53:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:21,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270361716] [2022-12-14 15:53:21,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:21,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:21,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270361716] [2022-12-14 15:53:21,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270361716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:21,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:21,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:21,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443641126] [2022-12-14 15:53:21,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:21,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:21,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:21,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:21,502 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:21,528 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-12-14 15:53:21,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:21,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 15:53:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:21,530 INFO L225 Difference]: With dead ends: 27 [2022-12-14 15:53:21,530 INFO L226 Difference]: Without dead ends: 27 [2022-12-14 15:53:21,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:21,532 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:21,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-12-14 15:53:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-12-14 15:53:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.8) internal successors, (27), 26 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 15:53:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-12-14 15:53:21,535 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 3 [2022-12-14 15:53:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:21,535 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-12-14 15:53:21,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 15:53:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-12-14 15:53:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 15:53:21,536 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:21,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 15:53:21,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:53:21,536 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:21,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash 96711, now seen corresponding path program 1 times [2022-12-14 15:53:21,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:21,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224073732] [2022-12-14 15:53:21,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:21,732 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 15:53:21,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:21,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224073732] [2022-12-14 15:53:21,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224073732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:21,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:21,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:21,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348364903] [2022-12-14 15:53:21,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:21,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:21,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:21,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:21,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:21,735 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:21,766 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-12-14 15:53:21,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:21,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 15:53:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:21,767 INFO L225 Difference]: With dead ends: 25 [2022-12-14 15:53:21,767 INFO L226 Difference]: Without dead ends: 25 [2022-12-14 15:53:21,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:21,768 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:21,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 12 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-14 15:53:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-12-14 15:53:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.6666666666666667) 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 15:53:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-12-14 15:53:21,771 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 3 [2022-12-14 15:53:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:21,771 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-12-14 15:53:21,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-12-14 15:53:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 15:53:21,771 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:21,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 15:53:21,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 15:53:21,772 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash 92979570, now seen corresponding path program 1 times [2022-12-14 15:53:21,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:21,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228953449] [2022-12-14 15:53:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:21,842 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 15:53:21,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:21,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228953449] [2022-12-14 15:53:21,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228953449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:21,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:21,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:21,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988135939] [2022-12-14 15:53:21,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:21,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:21,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:21,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:21,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:21,845 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) 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 15:53:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:21,884 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-12-14 15:53:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:21,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) 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 15:53:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:21,885 INFO L225 Difference]: With dead ends: 24 [2022-12-14 15:53:21,885 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 15:53:21,885 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 15:53:21,886 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:21,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:21,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 15:53:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-12-14 15:53:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 23 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 15:53:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-12-14 15:53:21,889 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 5 [2022-12-14 15:53:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:21,889 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-12-14 15:53:21,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) 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 15:53:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-12-14 15:53:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 15:53:21,890 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:21,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 15:53:21,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 15:53:21,890 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:21,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:21,890 INFO L85 PathProgramCache]: Analyzing trace with hash 92979571, now seen corresponding path program 1 times [2022-12-14 15:53:21,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:21,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578112372] [2022-12-14 15:53:21,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:21,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:22,024 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 15:53:22,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:22,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578112372] [2022-12-14 15:53:22,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578112372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:22,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:22,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:53:22,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442058056] [2022-12-14 15:53:22,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:22,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:53:22,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:22,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:53:22,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:53:22,027 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 5 states, 4 states have (on average 1.25) 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 15:53:22,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:22,102 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-12-14 15:53:22,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:53:22,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) 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 15:53:22,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:22,103 INFO L225 Difference]: With dead ends: 30 [2022-12-14 15:53:22,103 INFO L226 Difference]: Without dead ends: 30 [2022-12-14 15:53:22,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 15:53:22,105 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:22,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 29 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:22,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-12-14 15:53:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-12-14 15:53:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 25 states have internal predecessors, (26), 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 15:53:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-12-14 15:53:22,108 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 5 [2022-12-14 15:53:22,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:22,108 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-12-14 15:53:22,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) 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 15:53:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-12-14 15:53:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:53:22,108 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:22,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:53:22,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 15:53:22,109 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:22,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:22,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1412600624, now seen corresponding path program 1 times [2022-12-14 15:53:22,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:22,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771990298] [2022-12-14 15:53:22,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:22,191 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 15:53:22,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:22,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771990298] [2022-12-14 15:53:22,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771990298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:22,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:22,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:53:22,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163872296] [2022-12-14 15:53:22,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:22,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:53:22,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:22,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:53:22,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:53:22,192 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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 15:53:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:22,246 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-12-14 15:53:22,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:53:22,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 15:53:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:22,247 INFO L225 Difference]: With dead ends: 25 [2022-12-14 15:53:22,247 INFO L226 Difference]: Without dead ends: 25 [2022-12-14 15:53:22,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:53:22,248 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:22,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 21 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-14 15:53:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-12-14 15:53:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.4705882352941178) 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 15:53:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-12-14 15:53:22,250 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 6 [2022-12-14 15:53:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:22,250 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-12-14 15:53:22,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 15:53:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-12-14 15:53:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:53:22,251 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:22,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:53:22,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 15:53:22,251 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:22,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:22,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1412600623, now seen corresponding path program 1 times [2022-12-14 15:53:22,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:22,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372641138] [2022-12-14 15:53:22,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:22,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:22,420 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 15:53:22,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:22,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372641138] [2022-12-14 15:53:22,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372641138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:22,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:22,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:53:22,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974909834] [2022-12-14 15:53:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:22,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:53:22,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:22,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:53:22,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:53:22,422 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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 15:53:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:22,505 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-12-14 15:53:22,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:53:22,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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 15:53:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:22,506 INFO L225 Difference]: With dead ends: 26 [2022-12-14 15:53:22,506 INFO L226 Difference]: Without dead ends: 26 [2022-12-14 15:53:22,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:53:22,507 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 7 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 15:53:22,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 7 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:22,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-12-14 15:53:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-12-14 15:53:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.3888888888888888) 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 15:53:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-12-14 15:53:22,509 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 6 [2022-12-14 15:53:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:22,509 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-12-14 15:53:22,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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 15:53:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-12-14 15:53:22,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 15:53:22,510 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:22,510 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:22,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 15:53:22,510 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:22,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:22,511 INFO L85 PathProgramCache]: Analyzing trace with hash -695614789, now seen corresponding path program 1 times [2022-12-14 15:53:22,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:22,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288944976] [2022-12-14 15:53:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:22,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:22,722 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 15:53:22,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:22,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288944976] [2022-12-14 15:53:22,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288944976] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:53:22,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014318037] [2022-12-14 15:53:22,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:22,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:22,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:22,724 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:22,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:53:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:22,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-14 15:53:22,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:22,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 15:53:22,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:53:22,998 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 20 treesize of output 17 [2022-12-14 15:53:23,124 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 15:53:23,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:23,319 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 15 treesize of output 13 [2022-12-14 15:53:23,323 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 15:53:23,331 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 20 treesize of output 16 [2022-12-14 15:53:23,344 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 15:53:23,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014318037] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:23,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1579140281] [2022-12-14 15:53:23,358 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 15:53:23,359 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:53:23,362 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:53:23,367 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:53:23,367 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:53:23,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:23,424 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 15:53:23,458 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 15:53:23,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:53:23,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:23,535 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 15:53:23,535 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 15:53:23,652 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 15:53:23,653 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 15:53:23,700 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 15:53:23,700 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 15:53:23,707 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:53:24,233 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '512#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 15:53:24,234 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:53:24,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:53:24,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-14 15:53:24,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098501163] [2022-12-14 15:53:24,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:24,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 15:53:24,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:24,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 15:53:24,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2022-12-14 15:53:24,236 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 19 states, 18 states have (on average 1.3333333333333333) 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 15:53:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:24,484 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-12-14 15:53:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:53:24,485 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.3333333333333333) 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 9 [2022-12-14 15:53:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:24,485 INFO L225 Difference]: With dead ends: 31 [2022-12-14 15:53:24,485 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 15:53:24,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 15:53:24,487 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 47 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:24,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 68 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:53:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 15:53:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-12-14 15:53:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-12-14 15:53:24,490 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 9 [2022-12-14 15:53:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:24,490 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-12-14 15:53:24,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.3333333333333333) 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 15:53:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-12-14 15:53:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:53:24,490 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:24,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:24,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:53:24,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:24,692 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:24,692 INFO L85 PathProgramCache]: Analyzing trace with hash -89248343, now seen corresponding path program 1 times [2022-12-14 15:53:24,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:24,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233355931] [2022-12-14 15:53:24,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:24,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:24,724 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 15:53:24,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:24,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233355931] [2022-12-14 15:53:24,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233355931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:24,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:24,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:24,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888518991] [2022-12-14 15:53:24,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:24,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:24,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:24,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:24,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:24,726 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:24,735 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-12-14 15:53:24,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:24,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 15:53:24,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:24,737 INFO L225 Difference]: With dead ends: 27 [2022-12-14 15:53:24,737 INFO L226 Difference]: Without dead ends: 27 [2022-12-14 15:53:24,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:24,738 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 13 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 15:53:24,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 13 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:24,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-12-14 15:53:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-12-14 15:53:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-12-14 15:53:24,741 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 10 [2022-12-14 15:53:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:24,741 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-12-14 15:53:24,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 15:53:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-12-14 15:53:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:53:24,742 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:24,742 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:24,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 15:53:24,742 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:24,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:24,743 INFO L85 PathProgramCache]: Analyzing trace with hash -89222007, now seen corresponding path program 1 times [2022-12-14 15:53:24,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:24,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337521795] [2022-12-14 15:53:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:24,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:25,232 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 15:53:25,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:25,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337521795] [2022-12-14 15:53:25,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337521795] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:53:25,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600677036] [2022-12-14 15:53:25,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:25,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:25,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:25,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:25,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 15:53:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:25,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-14 15:53:25,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:25,329 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 15:53:25,336 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 15:53:25,396 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 15:53:25,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:53:25,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 15:53:25,786 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 15:53:25,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:26,036 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 15:53:26,038 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 15:53:26,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:53:26,125 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 15:53:26,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600677036] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:26,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1452324756] [2022-12-14 15:53:26,127 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 15:53:26,127 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:53:26,127 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:53:26,127 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:53:26,127 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:53:26,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:26,153 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 15:53:26,180 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 15:53:26,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:53:26,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:26,238 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 15:53:26,238 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 15:53:26,299 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 15:53:26,300 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 15:53:26,348 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 15:53:26,348 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 15:53:26,354 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:53:26,955 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '729#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (= (select |#valid| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) |ULTIMATE.start_cstrcpy_#t~mem207#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 15:53:26,956 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:53:26,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:53:26,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 15:53:26,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307349627] [2022-12-14 15:53:26,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:26,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 15:53:26,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:26,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 15:53:26,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 15:53:26,958 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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 15:53:28,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:28,370 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-12-14 15:53:28,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:53:28,371 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 15:53:28,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:28,371 INFO L225 Difference]: With dead ends: 28 [2022-12-14 15:53:28,371 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 15:53:28,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 15:53:28,372 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 117 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:28,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 23 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:53:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 15:53:28,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-12-14 15:53:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 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 15:53:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-12-14 15:53:28,374 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2022-12-14 15:53:28,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:28,374 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-12-14 15:53:28,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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 15:53:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-12-14 15:53:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:53:28,375 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:28,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:28,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 15:53:28,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:28,577 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1528268744, now seen corresponding path program 1 times [2022-12-14 15:53:28,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:28,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963412161] [2022-12-14 15:53:28,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:28,631 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 15:53:28,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:28,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963412161] [2022-12-14 15:53:28,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963412161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:28,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:28,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:53:28,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765129572] [2022-12-14 15:53:28,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:28,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:53:28,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:28,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:53:28,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:53:28,633 INFO L87 Difference]: Start difference. First operand 26 states and 27 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 15:53:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:28,658 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-12-14 15:53:28,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:53:28,658 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 15:53:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:28,659 INFO L225 Difference]: With dead ends: 25 [2022-12-14 15:53:28,659 INFO L226 Difference]: Without dead ends: 25 [2022-12-14 15:53:28,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:53:28,659 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:28,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 21 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-14 15:53:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-12-14 15:53:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 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 15:53:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-12-14 15:53:28,661 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 11 [2022-12-14 15:53:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:28,661 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-12-14 15:53:28,662 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 15:53:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-12-14 15:53:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:53:28,662 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:28,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:28,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 15:53:28,663 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:28,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash -212549590, now seen corresponding path program 1 times [2022-12-14 15:53:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:28,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831653408] [2022-12-14 15:53:28,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:28,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:28,680 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 15:53:28,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:28,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831653408] [2022-12-14 15:53:28,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831653408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:28,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:28,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:28,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392546917] [2022-12-14 15:53:28,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:28,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:28,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:28,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:28,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:28,681 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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 15:53:28,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:28,689 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-12-14 15:53:28,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:28,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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 15:53:28,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:28,690 INFO L225 Difference]: With dead ends: 24 [2022-12-14 15:53:28,690 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 15:53:28,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:28,691 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:28,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 15:53:28,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-12-14 15:53:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 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 15:53:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-12-14 15:53:28,692 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 13 [2022-12-14 15:53:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:28,693 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-12-14 15:53:28,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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 15:53:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-12-14 15:53:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:53:28,693 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:28,693 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2022-12-14 15:53:28,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 15:53:28,694 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:28,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash 571924483, now seen corresponding path program 2 times [2022-12-14 15:53:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:28,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671607373] [2022-12-14 15:53:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:28,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:29,061 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 15:53:29,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:29,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671607373] [2022-12-14 15:53:29,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671607373] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:53:29,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626741226] [2022-12-14 15:53:29,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:53:29,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:29,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:29,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:29,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 15:53:29,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 15:53:29,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:53:29,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 15:53:29,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:29,129 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 15:53:29,147 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 15:53:29,250 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 15:53:29,375 INFO L321 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-12-14 15:53:29,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2022-12-14 15:53:29,450 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 15:53:29,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:29,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:53:29,787 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 37 treesize of output 36 [2022-12-14 15:53:29,791 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 38 treesize of output 34 [2022-12-14 15:53:29,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-12-14 15:53:29,804 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 15:53:29,815 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 15:53:29,844 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 15:53:29,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626741226] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:29,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1277637944] [2022-12-14 15:53:29,845 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 15:53:29,845 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:53:29,845 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:53:29,845 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:53:29,845 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:53:29,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:29,872 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 15:53:29,897 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 15:53:29,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:53:29,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:29,959 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 15:53:29,960 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 15:53:30,033 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 15:53:30,033 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 15:53:30,087 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 15:53:30,087 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 15:53:30,097 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:53:30,905 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1021#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 15:53:30,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:53:30,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:53:30,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2022-12-14 15:53:30,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416733963] [2022-12-14 15:53:30,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:30,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 15:53:30,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:30,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 15:53:30,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1267, Unknown=2, NotChecked=0, Total=1406 [2022-12-14 15:53:30,907 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 31 states, 30 states have (on average 1.2333333333333334) 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 15:53:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:31,668 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-12-14 15:53:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:53:31,669 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.2333333333333334) 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) Word has length 13 [2022-12-14 15:53:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:31,669 INFO L225 Difference]: With dead ends: 40 [2022-12-14 15:53:31,669 INFO L226 Difference]: Without dead ends: 40 [2022-12-14 15:53:31,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=286, Invalid=2162, Unknown=2, NotChecked=0, Total=2450 [2022-12-14 15:53:31,670 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 100 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:31,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 51 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-14 15:53:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-12-14 15:53:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.2) 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 15:53:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-12-14 15:53:31,673 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 13 [2022-12-14 15:53:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:31,673 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-12-14 15:53:31,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.2333333333333334) 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 15:53:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-12-14 15:53:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 15:53:31,674 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:31,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:31,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 15:53:31,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:31,875 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:31,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2000897389, now seen corresponding path program 1 times [2022-12-14 15:53:31,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:31,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055998371] [2022-12-14 15:53:31,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:31,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:31,975 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 15:53:31,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:31,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055998371] [2022-12-14 15:53:31,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055998371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:31,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:31,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:31,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931835471] [2022-12-14 15:53:31,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:31,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:31,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:31,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:31,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:31,977 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) 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 15:53:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:31,989 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-12-14 15:53:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:31,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) 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 15:53:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:31,990 INFO L225 Difference]: With dead ends: 27 [2022-12-14 15:53:31,990 INFO L226 Difference]: Without dead ends: 27 [2022-12-14 15:53:31,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:31,990 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 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 15:53:31,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:31,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-12-14 15:53:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-12-14 15:53:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-12-14 15:53:31,992 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 14 [2022-12-14 15:53:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:31,992 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-12-14 15:53:31,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) 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 15:53:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-12-14 15:53:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:53:31,992 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:31,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:31,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 15:53:31,992 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1898277005, now seen corresponding path program 1 times [2022-12-14 15:53:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:31,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817049695] [2022-12-14 15:53:31,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:31,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:32,202 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 15:53:32,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:32,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817049695] [2022-12-14 15:53:32,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817049695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:32,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:32,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:53:32,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959000401] [2022-12-14 15:53:32,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:32,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:53:32,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:32,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:53:32,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:53:32,204 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 15:53:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:32,335 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-12-14 15:53:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:53:32,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 15:53:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:32,335 INFO L225 Difference]: With dead ends: 26 [2022-12-14 15:53:32,335 INFO L226 Difference]: Without dead ends: 18 [2022-12-14 15:53:32,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:53:32,336 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:32,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 14 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-14 15:53:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-14 15:53:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-12-14 15:53:32,337 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2022-12-14 15:53:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:32,337 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-12-14 15:53:32,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 15:53:32,337 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-12-14 15:53:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:53:32,337 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:32,337 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1] [2022-12-14 15:53:32,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 15:53:32,338 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:32,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2076449099, now seen corresponding path program 3 times [2022-12-14 15:53:32,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:32,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487429400] [2022-12-14 15:53:32,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:32,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:32,800 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 15:53:32,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:32,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487429400] [2022-12-14 15:53:32,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487429400] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:53:32,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578195295] [2022-12-14 15:53:32,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 15:53:32,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:32,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:32,801 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:32,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 15:53:32,857 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 15:53:32,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:53:32,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-14 15:53:32,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:32,872 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:53:32,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 15:53:32,876 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 15:53:32,907 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 15:53:33,079 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 15:53:33,354 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 15:53:33,605 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-12-14 15:53:33,605 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 40 treesize of output 39 [2022-12-14 15:53:33,749 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 15:53:33,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:36,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:53:36,624 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 15:53:36,629 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 15:53:36,638 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 80 treesize of output 70 [2022-12-14 15:53:36,646 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 15:53:36,652 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 15:53:36,789 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 15:53:36,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578195295] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:36,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1482679556] [2022-12-14 15:53:36,790 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 15:53:36,790 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:53:36,790 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:53:36,790 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:53:36,791 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:53:36,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:36,821 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 15:53:36,844 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 15:53:36,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:53:36,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:36,923 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 15:53:36,924 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 15:53:36,981 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 15:53:36,981 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 15:53:37,019 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 15:53:37,019 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 15:53:37,025 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:53:37,680 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1374#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 15:53:37,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:53:37,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:53:37,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 41 [2022-12-14 15:53:37,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146338496] [2022-12-14 15:53:37,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:37,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 15:53:37,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:37,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 15:53:37,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2169, Unknown=8, NotChecked=0, Total=2352 [2022-12-14 15:53:37,682 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 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 15:53:43,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:53:45,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:45,114 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-12-14 15:53:45,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 15:53:45,115 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:53:45,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:45,115 INFO L225 Difference]: With dead ends: 28 [2022-12-14 15:53:45,115 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 15:53:45,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=423, Invalid=3856, Unknown=11, NotChecked=0, Total=4290 [2022-12-14 15:53:45,117 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 54 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 26 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:45,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 452 Invalid, 6 Unknown, 0 Unchecked, 2.5s Time] [2022-12-14 15:53:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 15:53:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-12-14 15:53:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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 15:53:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-12-14 15:53:45,119 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 17 [2022-12-14 15:53:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:45,119 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-12-14 15:53:45,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 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 15:53:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-12-14 15:53:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 15:53:45,120 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:45,120 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1] [2022-12-14 15:53:45,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 15:53:45,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 15:53:45,322 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:53:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1429807141, now seen corresponding path program 4 times [2022-12-14 15:53:45,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:45,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063483277] [2022-12-14 15:53:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:45,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:46,159 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 15:53:46,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:46,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063483277] [2022-12-14 15:53:46,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063483277] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:53:46,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938344957] [2022-12-14 15:53:46,159 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 15:53:46,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:46,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:46,160 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:46,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 15:53:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:46,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 110 conjunts are in the unsatisfiable core [2022-12-14 15:53:46,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:46,257 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:53:46,257 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 15:53:46,261 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 15:53:46,292 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 15:53:46,444 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 15:53:46,703 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 31 treesize of output 29 [2022-12-14 15:53:46,996 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 39 treesize of output 35 [2022-12-14 15:53:47,332 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 15:53:47,631 INFO L321 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2022-12-14 15:53:47,631 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 49 treesize of output 47 [2022-12-14 15:53:47,807 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 15:53:47,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:50,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:53:50,125 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 15:53:50,131 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 15:53:50,136 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 15:53:50,140 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 15:53:50,150 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 98 treesize of output 80 [2022-12-14 15:53:50,170 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 15:53:50,175 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 15:53:50,298 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 15:53:50,333 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 15:53:50,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938344957] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:50,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [307581259] [2022-12-14 15:53:50,335 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 15:53:50,335 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:53:50,335 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:53:50,336 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:53:50,336 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:53:50,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:50,368 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 15:53:50,394 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 15:53:50,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:53:50,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:50,451 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 15:53:50,451 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 15:53:50,511 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 15:53:50,512 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 15:53:50,555 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 15:53:50,555 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 15:53:50,561 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:53:51,720 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1678#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 15:53:51,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:53:51,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:53:51,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 23] total 64 [2022-12-14 15:53:51,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368083365] [2022-12-14 15:53:51,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:51,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-14 15:53:51,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:51,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-14 15:53:51,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=4752, Unknown=32, NotChecked=0, Total=5112 [2022-12-14 15:53:51,725 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 65 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 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 15:54:05,154 WARN L233 SmtUtils]: Spent 11.02s on a formula simplification. DAG size of input: 136 DAG size of output: 120 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:54:20,815 WARN L233 SmtUtils]: Spent 15.45s on a formula simplification. DAG size of input: 161 DAG size of output: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:54:29,693 WARN L233 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 150 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:54:41,415 WARN L233 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 122 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:54:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:54:44,641 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-12-14 15:54:44,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 15:54:44,641 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 15:54:44,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:54:44,642 INFO L225 Difference]: With dead ends: 44 [2022-12-14 15:54:44,642 INFO L226 Difference]: Without dead ends: 44 [2022-12-14 15:54:44,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 56.9s TimeCoverageRelationStatistics Valid=951, Invalid=9705, Unknown=56, NotChecked=0, Total=10712 [2022-12-14 15:54:44,645 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 50 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:54:44,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 764 Invalid, 20 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 15:54:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-14 15:54:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-12-14 15:54:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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 15:54:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-12-14 15:54:44,647 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 25 [2022-12-14 15:54:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:54:44,647 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-12-14 15:54:44,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 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 15:54:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-12-14 15:54:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 15:54:44,647 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:54:44,647 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1] [2022-12-14 15:54:44,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 15:54:44,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 15:54:44,849 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:54:44,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:54:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1201292037, now seen corresponding path program 5 times [2022-12-14 15:54:44,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:54:44,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203686153] [2022-12-14 15:54:44,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:54:44,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:54:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:54:46,732 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 15:54:46,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:54:46,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203686153] [2022-12-14 15:54:46,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203686153] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:54:46,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051442299] [2022-12-14 15:54:46,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:54:46,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:54:46,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:54:46,734 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:54:46,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 15:54:46,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-12-14 15:54:46,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:54:46,908 WARN L261 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 211 conjunts are in the unsatisfiable core [2022-12-14 15:54:46,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:54:46,918 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 15:54:46,959 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 15:54:47,139 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 15:54:47,453 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 31 treesize of output 29 [2022-12-14 15:54:47,819 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 39 treesize of output 35 [2022-12-14 15:54:48,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-12-14 15:54:48,646 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 15:54:49,223 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 63 treesize of output 53 [2022-12-14 15:54:49,845 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 15:54:50,512 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 79 treesize of output 65 [2022-12-14 15:54:51,208 INFO L321 Elim1Store]: treesize reduction 32, result has 76.6 percent of original size [2022-12-14 15:54:51,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 17 case distinctions, treesize of input 83 treesize of output 143 [2022-12-14 15:54:51,230 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 15:54:51,251 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 15:54:51,772 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 15:54:51,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:54:54,313 WARN L837 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|))) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0))) is different from false [2022-12-14 15:54:55,302 WARN L837 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|))) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0))) is different from false [2022-12-14 15:54:57,869 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (< (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0))) is different from false [2022-12-14 15:54:59,416 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0))) is different from false [2022-12-14 15:55:01,332 WARN L837 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) (forall ((v_ArrVal_290 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (< (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0))) is different from false [2022-12-14 15:55:13,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:55:13,957 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 15:55:13,965 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 15:55:13,970 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 15:55:13,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 15:55:13,976 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 15:55:13,979 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 15:55:14,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:55:14,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 186 treesize of output 232 [2022-12-14 15:55:14,066 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 15:55:14,088 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 15:55:14,533 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 15:55:14,542 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 15:55:14,551 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 15:55:14,565 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 15:55:14,569 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 15:55:14,573 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 15:55:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 69 refuted. 58 times theorem prover too weak. 0 trivial. 35 not checked. [2022-12-14 15:55:14,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051442299] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:14,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [10313851] [2022-12-14 15:55:14,740 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 15:55:14,740 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:55:14,740 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:55:14,740 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:55:14,741 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:55:14,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:55:14,763 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 15:55:14,794 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 15:55:14,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:55:14,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:55:14,845 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 15:55:14,845 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 15:55:14,903 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 15:55:14,903 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 15:55:14,939 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 15:55:14,940 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 15:55:14,948 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:55:16,734 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2183#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 15:55:16,734 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:55:16,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:55:16,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 39, 39] total 107 [2022-12-14 15:55:16,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520932213] [2022-12-14 15:55:16,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:55:16,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-12-14 15:55:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:55:16,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-12-14 15:55:16,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=11036, Unknown=303, NotChecked=1100, Total=13110 [2022-12-14 15:55:16,738 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 108 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 108 states have internal predecessors, (121), 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 15:55:35,456 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post206#1.base|))) (let ((.cse7 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse2 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse10 (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse6 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse13 (not (= |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| |c_ULTIMATE.start_cstrcpy_#t~post206#1.base|))) (.cse16 (= |c_ULTIMATE.start_cstrcpy_#t~post206#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse3 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse5 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse4 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse8 (= (select .cse0 |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset|) 0))) (and (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (= (select .cse0 (+ (- 1) |ULTIMATE.start_main_~length2~0#1|)) 0) (<= |ULTIMATE.start_main_~length2~0#1| (select |c_#length| |c_ULTIMATE.start_cstrcpy_#t~post206#1.base|)) (<= 1 |ULTIMATE.start_main_~length2~0#1|))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_290))) (or (= (select (select (store .cse1 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (= (select (select .cse1 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (= (select (select (store .cse1 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0) (< (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|) (= (select (select (store .cse1 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0) (= (select (select (store .cse1 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0) (= (select (select (store .cse1 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (= (select (select (store .cse1 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0)))) .cse8) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_289))) (or (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0) (< (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0) (= (select (select .cse9 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)))) .cse8) (= 0 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) (not (= (select .cse0 6) 0)) (not (= (select .cse0 5) 0)) (or (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_295))) (or (= (select (select (store .cse11 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (= (select (select .cse11 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (< .cse2 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) .cse8) (not (= (select .cse0 3) 0)) (or (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_293))) (or (= (select (select .cse12 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= 0 (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|))) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (= (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0) (< .cse6 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|) (= 0 (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2))))) .cse8) (or (not (<= 0 |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset|)) (and (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= .cse5 .cse3)) .cse8) (= |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset| 7) (not (= (select .cse0 4) 0)) .cse13 (not (= 0 (select .cse0 1))) (<= 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (not (= (select .cse0 0) 0)) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_292))) (or (= 0 (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4)) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< .cse7 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|) (= (select (select .cse14 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)))) .cse8) (= |c_ULTIMATE.start_main_~length2~0#1| (+ (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (* 18446744073709551616 (div |c_ULTIMATE.start_main_~length2~0#1| 18446744073709551616)))) (not (= (select .cse0 2) 0)) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_291))) (or (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0) (< .cse10 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (= (select (select .cse15 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)))) .cse8) .cse16 (or (and .cse13 (= (select .cse0 (+ (- 1) .cse3)) 0) .cse16) (<= (+ 18446744073709551609 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse3)) (or (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_294))) (or (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (= (select (select .cse17 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0) (< .cse4 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) .cse8)))) is different from true [2022-12-14 15:55:37,539 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse5 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse13 (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse7 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse2 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse9 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse3 (= |c_ULTIMATE.start_cstrcpy_#t~mem207#1| 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse16 (not (= |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (.cse1 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (and (not (= (select .cse0 4) 0)) (not (= (select .cse0 2) 0)) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= (select .cse0 (+ (- 1) |ULTIMATE.start_main_~length2~0#1|)) 0) (<= |ULTIMATE.start_main_~length2~0#1| .cse1))) (or (and (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= .cse2 .cse1)) .cse3) (not (= (select .cse0 0) 0)) (not (= (select .cse0 3) 0)) (or (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_295))) (or (= (select (select (store .cse4 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse1) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (= (select (select .cse4 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (< .cse5 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) .cse3) (<= |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 8) (or (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_293))) (or (= (select (select .cse6 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= 0 (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|))) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse1) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (= (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (< .cse7 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|) (= 0 (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5))))) .cse3) (not (= (select .cse0 1) 0)) (<= 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_290))) (or (= (select (select (store .cse8 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse1) (= (select (select .cse8 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (= (select (select (store .cse8 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse9) 0) (< (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|) (= (select (select (store .cse8 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse8 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select (store .cse8 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (= (select (select (store .cse8 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0)))) .cse3) (= (select .cse0 7) |c_ULTIMATE.start_cstrcpy_#t~mem207#1|) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_292))) (or (= 0 (select (select (store .cse11 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse9)) (= (select (select (store .cse11 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (= (select (select (store .cse11 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse1) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< .cse10 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|) (= (select (select .cse11 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse11 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)))) .cse3) (not (= (select .cse0 6) 0)) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_289))) (or (= (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse13) 0) (= (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0) (= (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (< (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse1) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (= (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0) (= (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (= (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse9) 0) (= (select (select .cse12 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)))) .cse3) (not (= (select .cse0 5) 0)) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_291))) (or (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse9) 0) (< .cse13 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse1) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (= (select (select .cse14 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0)))) .cse3) (or (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_294))) (or (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (= (select (select .cse15 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse1) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (< .cse9 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) .cse3) .cse16 (or (and (= (select .cse0 (+ (- 1) .cse1)) 0) .cse16) (<= (+ 18446744073709551609 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1)))) is different from true [2022-12-14 15:56:07,052 WARN L233 SmtUtils]: Spent 18.45s on a formula simplification. DAG size of input: 230 DAG size of output: 162 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:56:08,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:56:09,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:56:11,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:56:13,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:56:15,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:56:17,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:56:50,227 WARN L233 SmtUtils]: Spent 18.75s on a formula simplification. DAG size of input: 277 DAG size of output: 170 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:56:51,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:56:53,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:56:56,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 [0, 1] [2022-12-14 15:56:57,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:56:59,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:57:17,087 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 171 DAG size of output: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:57:20,214 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 15:57:21,702 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse7 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse17 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse3 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse6 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) (let ((.cse1 (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< .cse6 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) (.cse2 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0))) (.cse8 (= |c_ULTIMATE.start_cstrcpy_#t~mem207#1| 0)) (.cse12 (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (< (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|))))) (.cse13 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse17) 0))) (.cse14 (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0))) (.cse15 (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0))) (.cse16 (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0))) (.cse0 (= (select .cse5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) (.cse9 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0))) (.cse10 (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< .cse17 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) (.cse11 (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (and (or .cse0 .cse1 .cse2) (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (not (<= |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| .cse4)) (= (select .cse5 (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0))) (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or .cse0 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|))) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0))) (<= .cse4 .cse3) (or .cse0 .cse1 .cse2 .cse8) (or .cse0 .cse9 .cse10 .cse11 .cse8) (or .cse0 (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< .cse7 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) (or .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse8) (or .cse12 .cse0 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse9 .cse10 .cse11)))) is different from false [2022-12-14 15:57:27,985 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse3 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse6 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) (let ((.cse1 (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< .cse6 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) (.cse2 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0))) (.cse8 (= |c_ULTIMATE.start_cstrcpy_#t~mem207#1| 0)) (.cse0 (= (select .cse5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) (.cse9 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0))) (.cse10 (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) (.cse11 (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (and (or .cse0 .cse1 .cse2) (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (not (<= |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| .cse4)) (= (select .cse5 (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0))) (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or .cse0 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|))) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0))) (<= .cse4 .cse3) (or .cse0 .cse1 .cse2 .cse8) (or .cse0 .cse9 .cse10 .cse11 .cse8) (or .cse0 (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< .cse7 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) (or .cse0 .cse9 .cse10 .cse11)))) is different from false [2022-12-14 15:57:31,301 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse3 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (let ((.cse1 (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) (.cse2 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0))) (.cse6 (= |c_ULTIMATE.start_cstrcpy_#t~mem207#1| 0)) (.cse0 (= (select .cse5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) (.cse7 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0))) (.cse8 (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) (.cse9 (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (and (or .cse0 .cse1 .cse2) (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (not (<= |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| .cse4)) (= (select .cse5 (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0))) (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= .cse4 .cse3) (or .cse0 .cse1 .cse2 .cse6) (or .cse0 .cse7 .cse8 .cse9 .cse6) (or .cse0 (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< .cse10 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) (or .cse0 .cse7 .cse8 .cse9)))) is different from false [2022-12-14 15:57:40,393 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse3 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (let ((.cse1 (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)))) (.cse2 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0))) (.cse0 (= (select .cse5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0))) (and (or .cse0 .cse1 .cse2) (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (not (<= |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| .cse4)) (= (select .cse5 (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0))) (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= .cse4 .cse3) (or .cse0 .cse1 .cse2 (= |c_ULTIMATE.start_cstrcpy_#t~mem207#1| 0)) (or .cse0 (forall ((v_ArrVal_296 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65| 1) .cse3) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|)) (< (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_65|))))))) is different from false [2022-12-14 15:57:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:57:58,834 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-12-14 15:57:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-12-14 15:57:58,835 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 108 states have internal predecessors, (121), 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 41 [2022-12-14 15:57:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:57:58,835 INFO L225 Difference]: With dead ends: 74 [2022-12-14 15:57:58,835 INFO L226 Difference]: Without dead ends: 74 [2022-12-14 15:57:58,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4248 ImplicationChecksByTransitivity, 161.6s TimeCoverageRelationStatistics Valid=1958, Invalid=23239, Unknown=607, NotChecked=3608, Total=29412 [2022-12-14 15:57:58,840 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 183 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 151 mSolverCounterUnsat, 227 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 227 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:57:58,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 4 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 2146 Invalid, 227 Unknown, 214 Unchecked, 28.2s Time] [2022-12-14 15:57:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-14 15:57:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-12-14 15:57:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 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 15:57:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2022-12-14 15:57:58,842 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 41 [2022-12-14 15:57:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:57:58,843 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2022-12-14 15:57:58,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 108 states have internal predecessors, (121), 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 15:57:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-12-14 15:57:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 15:57:58,844 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:57:58,844 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1] [2022-12-14 15:57:58,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-14 15:57:59,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:57:59,045 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-14 15:57:59,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:57:59,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1849116869, now seen corresponding path program 6 times [2022-12-14 15:57:59,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:57:59,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984335412] [2022-12-14 15:57:59,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:57:59,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:57:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:58:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:58:03,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:58:03,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984335412] [2022-12-14 15:58:03,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984335412] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:58:03,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737445496] [2022-12-14 15:58:03,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 15:58:03,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:58:03,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:58:03,057 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:58:03,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6228eff5-2512-4191-8909-434d6aedbf59/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 15:58:03,860 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 15:58:03,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:58:03,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 308 conjunts are in the unsatisfiable core [2022-12-14 15:58:03,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:58:03,877 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 15:58:03,941 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 15:58:04,227 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 15:58:04,647 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 31 treesize of output 29 [2022-12-14 15:58:05,149 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 39 treesize of output 35 [2022-12-14 15:58:05,712 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 15:58:06,329 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 15:58:07,022 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 63 treesize of output 53 [2022-12-14 15:58:07,765 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 15:58:08,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 81 treesize of output 67 [2022-12-14 15:58:09,507 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 87 treesize of output 71 [2022-12-14 15:58:10,558 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 95 treesize of output 77 [2022-12-14 15:58:11,608 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 103 treesize of output 83 [2022-12-14 15:58:12,850 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 111 treesize of output 89 [2022-12-14 15:58:13,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 95 [2022-12-14 15:58:15,297 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 129 treesize of output 103 [2022-12-14 15:58:16,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 135 treesize of output 107 [2022-12-14 15:58:18,001 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 145 treesize of output 115 [2022-12-14 15:58:19,336 INFO L321 Elim1Store]: treesize reduction 64, result has 53.3 percent of original size [2022-12-14 15:58:19,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 136 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 17 case distinctions, treesize of input 145 treesize of output 143 [2022-12-14 15:58:19,341 WARN L718 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2022-12-14 15:58:21,370 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-12-14 15:58:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:58:26,125 INFO L328 TraceCheckSpWp]: Computing backward predicates...