./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b 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_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9 --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 29a0de6b7697865a37e60a82150f204059592b57f74fd0ca1d5024446fc510b4 --- 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-6b4ec56 [2022-11-20 19:42:52,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 19:42:52,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 19:42:52,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 19:42:52,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 19:42:52,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 19:42:52,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 19:42:52,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 19:42:52,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 19:42:52,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 19:42:52,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 19:42:52,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 19:42:52,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 19:42:52,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 19:42:52,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 19:42:52,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 19:42:52,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 19:42:52,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 19:42:52,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 19:42:52,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 19:42:52,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 19:42:52,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 19:42:52,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 19:42:52,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 19:42:52,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 19:42:52,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 19:42:52,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 19:42:52,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 19:42:52,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 19:42:52,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 19:42:52,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 19:42:52,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 19:42:52,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 19:42:52,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 19:42:52,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 19:42:52,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 19:42:52,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 19:42:52,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 19:42:52,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 19:42:52,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 19:42:52,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 19:42:52,611 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-11-20 19:42:52,635 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 19:42:52,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 19:42:52,635 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 19:42:52,635 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 19:42:52,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 19:42:52,636 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 19:42:52,636 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 19:42:52,637 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 19:42:52,637 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 19:42:52,637 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 19:42:52,637 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 19:42:52,637 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 19:42:52,637 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 19:42:52,638 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 19:42:52,638 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 19:42:52,638 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 19:42:52,638 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 19:42:52,638 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 19:42:52,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 19:42:52,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 19:42:52,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 19:42:52,640 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 19:42:52,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 19:42:52,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 19:42:52,640 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 19:42:52,640 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 19:42:52,640 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 19:42:52,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 19:42:52,641 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 19:42:52,641 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 19:42:52,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 19:42:52,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 19:42:52,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:42:52,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 19:42:52,642 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 19:42:52,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 19:42:52,642 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 19:42:52,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 19:42:52,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 19:42:52,643 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_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/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_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9 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 -> 29a0de6b7697865a37e60a82150f204059592b57f74fd0ca1d5024446fc510b4 [2022-11-20 19:42:52,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 19:42:52,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 19:42:52,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 19:42:52,915 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 19:42:52,916 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 19:42:52,917 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca.i [2022-11-20 19:42:56,031 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 19:42:56,272 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 19:42:56,295 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca.i [2022-11-20 19:42:56,322 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/data/ac1e7818a/1a0713dd97cd416f9bd57ad3e004a6d7/FLAGfc2e83ce9 [2022-11-20 19:42:56,359 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/data/ac1e7818a/1a0713dd97cd416f9bd57ad3e004a6d7 [2022-11-20 19:42:56,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 19:42:56,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 19:42:56,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 19:42:56,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 19:42:56,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 19:42:56,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:42:56" (1/1) ... [2022-11-20 19:42:56,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7451f4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56, skipping insertion in model container [2022-11-20 19:42:56,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:42:56" (1/1) ... [2022-11-20 19:42:56,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 19:42:56,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 19:42:56,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:42:56,757 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 19:42:56,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:42:56,861 INFO L208 MainTranslator]: Completed translation [2022-11-20 19:42:56,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56 WrapperNode [2022-11-20 19:42:56,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 19:42:56,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 19:42:56,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 19:42:56,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 19:42:56,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56" (1/1) ... [2022-11-20 19:42:56,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56" (1/1) ... [2022-11-20 19:42:56,901 INFO L138 Inliner]: procedures = 152, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2022-11-20 19:42:56,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 19:42:56,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 19:42:56,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 19:42:56,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 19:42:56,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56" (1/1) ... [2022-11-20 19:42:56,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56" (1/1) ... [2022-11-20 19:42:56,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56" (1/1) ... [2022-11-20 19:42:56,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56" (1/1) ... [2022-11-20 19:42:56,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56" (1/1) ... [2022-11-20 19:42:56,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56" (1/1) ... [2022-11-20 19:42:56,925 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56" (1/1) ... [2022-11-20 19:42:56,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56" (1/1) ... [2022-11-20 19:42:56,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 19:42:56,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 19:42:56,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 19:42:56,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 19:42:56,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56" (1/1) ... [2022-11-20 19:42:56,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:42:56,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:42:56,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 19:42:56,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 19:42:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 19:42:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 19:42:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 19:42:57,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 19:42:57,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 19:42:57,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 19:42:57,118 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 19:42:57,120 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 19:42:57,363 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 19:42:57,462 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 19:42:57,463 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 19:42:57,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:42:57 BoogieIcfgContainer [2022-11-20 19:42:57,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 19:42:57,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 19:42:57,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 19:42:57,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 19:42:57,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:42:56" (1/3) ... [2022-11-20 19:42:57,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5153af2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:42:57, skipping insertion in model container [2022-11-20 19:42:57,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:42:56" (2/3) ... [2022-11-20 19:42:57,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5153af2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:42:57, skipping insertion in model container [2022-11-20 19:42:57,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:42:57" (3/3) ... [2022-11-20 19:42:57,474 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncpy_diffterm_alloca.i [2022-11-20 19:42:57,500 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 19:42:57,500 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-20 19:42:57,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 19:42:57,557 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;@7e0de457, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 19:42:57,558 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-20 19:42:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 20 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-11-20 19:42:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 19:42:57,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:42:57,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 19:42:57,568 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:42:57,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:42:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash 3334, now seen corresponding path program 1 times [2022-11-20 19:42:57,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:42:57,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194215322] [2022-11-20 19:42:57,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:42:57,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:42:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:42:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:42:57,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:42:57,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194215322] [2022-11-20 19:42:57,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194215322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:42:57,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:42:57,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 19:42:57,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502652905] [2022-11-20 19:42:57,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:42:57,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 19:42:57,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:42:57,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 19:42:57,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:42:57,919 INFO L87 Difference]: Start difference. First operand has 21 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 20 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:42:57,986 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-11-20 19:42:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 19:42:57,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-20 19:42:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:42:57,997 INFO L225 Difference]: With dead ends: 20 [2022-11-20 19:42:57,997 INFO L226 Difference]: Without dead ends: 19 [2022-11-20 19:42:58,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:42:58,010 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:42:58,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 10 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:42:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-20 19:42:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-20 19:42:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-20 19:42:58,045 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 2 [2022-11-20 19:42:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:42:58,046 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-20 19:42:58,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-11-20 19:42:58,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 19:42:58,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:42:58,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 19:42:58,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 19:42:58,051 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:42:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:42:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash 3335, now seen corresponding path program 1 times [2022-11-20 19:42:58,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:42:58,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710606882] [2022-11-20 19:42:58,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:42:58,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:42:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:42:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:42:58,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:42:58,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710606882] [2022-11-20 19:42:58,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710606882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:42:58,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:42:58,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 19:42:58,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512574236] [2022-11-20 19:42:58,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:42:58,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 19:42:58,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:42:58,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 19:42:58,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:42:58,411 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:42:58,436 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-11-20 19:42:58,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 19:42:58,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-20 19:42:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:42:58,437 INFO L225 Difference]: With dead ends: 18 [2022-11-20 19:42:58,437 INFO L226 Difference]: Without dead ends: 18 [2022-11-20 19:42:58,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 19:42:58,439 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 19:42:58,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 19:42:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-20 19:42:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-20 19:42:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-11-20 19:42:58,443 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 2 [2022-11-20 19:42:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:42:58,444 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-11-20 19:42:58,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-11-20 19:42:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 19:42:58,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:42:58,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 19:42:58,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 19:42:58,445 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:42:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:42:58,446 INFO L85 PathProgramCache]: Analyzing trace with hash 3252922, now seen corresponding path program 1 times [2022-11-20 19:42:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:42:58,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794654814] [2022-11-20 19:42:58,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:42:58,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:42:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:42:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:42:58,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:42:58,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794654814] [2022-11-20 19:42:58,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794654814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:42:58,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:42:58,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 19:42:58,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771670770] [2022-11-20 19:42:58,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:42:58,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 19:42:58,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:42:58,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 19:42:58,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 19:42:58,535 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:42:58,577 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-11-20 19:42:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 19:42:58,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-20 19:42:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:42:58,578 INFO L225 Difference]: With dead ends: 17 [2022-11-20 19:42:58,578 INFO L226 Difference]: Without dead ends: 17 [2022-11-20 19:42:58,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:42:58,580 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 19:42:58,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 19:42:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-20 19:42:58,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-20 19:42:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-20 19:42:58,583 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 4 [2022-11-20 19:42:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:42:58,584 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-20 19:42:58,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-20 19:42:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 19:42:58,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:42:58,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 19:42:58,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 19:42:58,585 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:42:58,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:42:58,586 INFO L85 PathProgramCache]: Analyzing trace with hash 3252923, now seen corresponding path program 1 times [2022-11-20 19:42:58,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:42:58,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215198644] [2022-11-20 19:42:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:42:58,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:42:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:42:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:42:58,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:42:58,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215198644] [2022-11-20 19:42:58,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215198644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:42:58,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:42:58,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 19:42:58,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359108474] [2022-11-20 19:42:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:42:58,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 19:42:58,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:42:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 19:42:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:42:58,779 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:42:58,861 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-11-20 19:42:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:42:58,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-20 19:42:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:42:58,862 INFO L225 Difference]: With dead ends: 26 [2022-11-20 19:42:58,862 INFO L226 Difference]: Without dead ends: 26 [2022-11-20 19:42:58,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 19:42:58,864 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:42:58,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:42:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-20 19:42:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2022-11-20 19:42:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-11-20 19:42:58,872 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 4 [2022-11-20 19:42:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:42:58,873 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-11-20 19:42:58,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-11-20 19:42:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 19:42:58,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:42:58,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 19:42:58,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 19:42:58,877 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:42:58,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:42:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash 100840584, now seen corresponding path program 1 times [2022-11-20 19:42:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:42:58,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844910094] [2022-11-20 19:42:58,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:42:58,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:42:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:42:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:42:59,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:42:59,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844910094] [2022-11-20 19:42:59,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844910094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:42:59,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:42:59,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 19:42:59,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846450994] [2022-11-20 19:42:59,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:42:59,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 19:42:59,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:42:59,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 19:42:59,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 19:42:59,041 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:42:59,119 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-11-20 19:42:59,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 19:42:59,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 19:42:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:42:59,120 INFO L225 Difference]: With dead ends: 18 [2022-11-20 19:42:59,120 INFO L226 Difference]: Without dead ends: 18 [2022-11-20 19:42:59,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-20 19:42:59,121 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 19:42:59,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 10 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 19:42:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-20 19:42:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-20 19:42:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-20 19:42:59,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 5 [2022-11-20 19:42:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:42:59,125 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-20 19:42:59,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-20 19:42:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 19:42:59,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:42:59,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 19:42:59,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 19:42:59,126 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:42:59,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:42:59,127 INFO L85 PathProgramCache]: Analyzing trace with hash 100840585, now seen corresponding path program 1 times [2022-11-20 19:42:59,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:42:59,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172511901] [2022-11-20 19:42:59,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:42:59,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:42:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:42:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:42:59,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:42:59,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172511901] [2022-11-20 19:42:59,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172511901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:42:59,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:42:59,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 19:42:59,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513521221] [2022-11-20 19:42:59,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:42:59,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 19:42:59,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:42:59,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 19:42:59,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:42:59,420 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:42:59,526 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-11-20 19:42:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:42:59,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 19:42:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:42:59,528 INFO L225 Difference]: With dead ends: 23 [2022-11-20 19:42:59,529 INFO L226 Difference]: Without dead ends: 23 [2022-11-20 19:42:59,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 19:42:59,534 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:42:59,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 18 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:42:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-20 19:42:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2022-11-20 19:42:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-11-20 19:42:59,548 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 5 [2022-11-20 19:42:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:42:59,549 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-11-20 19:42:59,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-11-20 19:42:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 19:42:59,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:42:59,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 19:42:59,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 19:42:59,551 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:42:59,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:42:59,551 INFO L85 PathProgramCache]: Analyzing trace with hash 100888913, now seen corresponding path program 1 times [2022-11-20 19:42:59,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:42:59,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621209182] [2022-11-20 19:42:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:42:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:42:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:42:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:42:59,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:42:59,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621209182] [2022-11-20 19:42:59,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621209182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:42:59,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:42:59,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 19:42:59,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349113573] [2022-11-20 19:42:59,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:42:59,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 19:42:59,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:42:59,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 19:42:59,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 19:42:59,638 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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-11-20 19:42:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:42:59,666 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-11-20 19:42:59,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 19:42:59,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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-11-20 19:42:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:42:59,669 INFO L225 Difference]: With dead ends: 19 [2022-11-20 19:42:59,669 INFO L226 Difference]: Without dead ends: 19 [2022-11-20 19:42:59,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:42:59,671 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 19:42:59,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 23 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 19:42:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-20 19:42:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-20 19:42:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.5) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:42:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-20 19:42:59,684 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 5 [2022-11-20 19:42:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:42:59,685 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-20 19:42:59,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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-11-20 19:42:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-11-20 19:42:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 19:42:59,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:42:59,686 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-20 19:42:59,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 19:42:59,687 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:42:59,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:42:59,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1959722964, now seen corresponding path program 1 times [2022-11-20 19:42:59,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:42:59,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841420849] [2022-11-20 19:42:59,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:42:59,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:42:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:00,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:43:00,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841420849] [2022-11-20 19:43:00,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841420849] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:43:00,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088393679] [2022-11-20 19:43:00,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:00,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:43:00,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:43:00,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:43:00,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 19:43:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:00,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 19:43:00,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:43:00,269 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 19:43:00,270 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-11-20 19:43:00,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-20 19:43:00,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:43:00,507 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 15 [2022-11-20 19:43:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:00,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:43:00,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-11-20 19:43:00,935 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-11-20 19:43:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:00,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088393679] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:43:00,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [733345471] [2022-11-20 19:43:00,997 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-20 19:43:00,997 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:43:01,001 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:43:01,006 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:43:01,006 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:43:01,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:01,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 19:43:01,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-20 19:43:01,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:43:01,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:01,313 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:43:01,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 31 [2022-11-20 19:43:01,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:01,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:01,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:01,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:01,551 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:43:01,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2022-11-20 19:43:01,736 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 19:43:01,737 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-11-20 19:43:01,880 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:43:03,035 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '404#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.base|) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|)) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc213#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_#t~malloc214#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc214#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.base|) (= |ULTIMATE.start_main_#t~malloc213#1.offset| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-20 19:43:03,035 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 19:43:03,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:43:03,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-20 19:43:03,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144549839] [2022-11-20 19:43:03,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:43:03,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 19:43:03,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:43:03,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 19:43:03,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-11-20 19:43:03,037 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:43:03,273 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-11-20 19:43:03,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 19:43:03,273 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-20 19:43:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:43:03,275 INFO L225 Difference]: With dead ends: 28 [2022-11-20 19:43:03,275 INFO L226 Difference]: Without dead ends: 28 [2022-11-20 19:43:03,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2022-11-20 19:43:03,277 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:43:03,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 60 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-11-20 19:43:03,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-20 19:43:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-11-20 19:43:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 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-11-20 19:43:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-11-20 19:43:03,283 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 8 [2022-11-20 19:43:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:43:03,283 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-20 19:43:03,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-11-20 19:43:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 19:43:03,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:43:03,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:43:03,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 19:43:03,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:43:03,485 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:43:03,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:43:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash 621317710, now seen corresponding path program 1 times [2022-11-20 19:43:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:43:03,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849381888] [2022-11-20 19:43:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:03,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:43:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:03,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:43:03,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849381888] [2022-11-20 19:43:03,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849381888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:43:03,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:43:03,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 19:43:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121348732] [2022-11-20 19:43:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:43:03,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 19:43:03,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:43:03,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 19:43:03,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 19:43:03,564 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:43:03,635 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-11-20 19:43:03,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 19:43:03,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 19:43:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:43:03,636 INFO L225 Difference]: With dead ends: 22 [2022-11-20 19:43:03,636 INFO L226 Difference]: Without dead ends: 22 [2022-11-20 19:43:03,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-20 19:43:03,637 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 19:43:03,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 18 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 19:43:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-20 19:43:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-11-20 19:43:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-11-20 19:43:03,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 9 [2022-11-20 19:43:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:43:03,640 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-11-20 19:43:03,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-11-20 19:43:03,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 19:43:03,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:43:03,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:43:03,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 19:43:03,642 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:43:03,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:43:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash 621317711, now seen corresponding path program 1 times [2022-11-20 19:43:03,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:43:03,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683211677] [2022-11-20 19:43:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:43:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:04,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:43:04,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683211677] [2022-11-20 19:43:04,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683211677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:43:04,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:43:04,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 19:43:04,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946137143] [2022-11-20 19:43:04,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:43:04,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 19:43:04,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:43:04,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 19:43:04,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 19:43:04,122 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:43:04,461 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-11-20 19:43:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 19:43:04,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 19:43:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:43:04,462 INFO L225 Difference]: With dead ends: 24 [2022-11-20 19:43:04,462 INFO L226 Difference]: Without dead ends: 24 [2022-11-20 19:43:04,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-11-20 19:43:04,463 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 46 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:43:04,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 11 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:43:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-20 19:43:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-20 19:43:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.45) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-11-20 19:43:04,465 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 9 [2022-11-20 19:43:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:43:04,465 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-11-20 19:43:04,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-11-20 19:43:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 19:43:04,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:43:04,466 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-11-20 19:43:04,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 19:43:04,466 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:43:04,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:43:04,467 INFO L85 PathProgramCache]: Analyzing trace with hash 621869712, now seen corresponding path program 1 times [2022-11-20 19:43:04,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:43:04,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8327136] [2022-11-20 19:43:04,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:04,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:43:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:04,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:43:04,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8327136] [2022-11-20 19:43:04,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8327136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:43:04,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329772858] [2022-11-20 19:43:04,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:04,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:43:04,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:43:04,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:43:04,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 19:43:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:04,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-20 19:43:04,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:43:04,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:04,946 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-11-20 19:43:04,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 19:43:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:05,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:43:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:05,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329772858] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:43:05,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [495263182] [2022-11-20 19:43:05,492 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-20 19:43:05,492 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:43:05,493 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:43:05,493 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:43:05,493 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:43:05,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:05,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 19:43:05,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-20 19:43:05,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:43:05,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:05,698 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:43:05,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 31 [2022-11-20 19:43:05,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:05,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:05,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:05,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:05,854 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:43:05,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-11-20 19:43:06,026 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 19:43:06,026 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-11-20 19:43:06,119 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:43:07,171 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '655#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc213#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_#t~malloc214#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) |ULTIMATE.start_cstrncpy_#t~mem208#1|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc214#1.base|) (= |ULTIMATE.start_cstrncpy_~src~0#1.offset| (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|)) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.base|) (= |ULTIMATE.start_main_#t~malloc213#1.offset| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= |ULTIMATE.start_cstrncpy_#t~post207#1.base| |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (select |#length| |ULTIMATE.start_cstrncpy_#t~post207#1.base|)) (= |ULTIMATE.start_cstrncpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrncpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrncpy_#t~post206#1.offset| 1)) (= (select |#valid| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) 1) (= |ULTIMATE.start_cstrncpy_#t~post206#1.base| |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (< 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)) (= |#NULL.base| 0))' at error location [2022-11-20 19:43:07,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 19:43:07,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:43:07,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-11-20 19:43:07,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080892067] [2022-11-20 19:43:07,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:43:07,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 19:43:07,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:43:07,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 19:43:07,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-11-20 19:43:07,173 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:43:07,547 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-11-20 19:43:07,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 19:43:07,548 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 19:43:07,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:43:07,548 INFO L225 Difference]: With dead ends: 35 [2022-11-20 19:43:07,548 INFO L226 Difference]: Without dead ends: 35 [2022-11-20 19:43:07,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2022-11-20 19:43:07,549 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 168 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:43:07,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 33 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:43:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-20 19:43:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2022-11-20 19:43:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-11-20 19:43:07,552 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 9 [2022-11-20 19:43:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:43:07,553 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-11-20 19:43:07,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-11-20 19:43:07,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 19:43:07,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:43:07,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:43:07,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 19:43:07,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 19:43:07,754 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:43:07,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:43:07,755 INFO L85 PathProgramCache]: Analyzing trace with hash 621918040, now seen corresponding path program 1 times [2022-11-20 19:43:07,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:43:07,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113003583] [2022-11-20 19:43:07,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:07,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:43:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:07,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:43:07,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113003583] [2022-11-20 19:43:07,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113003583] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:43:07,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386774689] [2022-11-20 19:43:07,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:07,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:43:07,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:43:07,942 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:43:07,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 19:43:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:08,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 19:43:08,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:43:08,122 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~malloc213#1.base_19| Int) (v_ArrVal_133 Int) (v_ArrVal_132 Int) (v_ArrVal_131 Int) (|v_ULTIMATE.start_main_#t~malloc214#1.base_19| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc213#1.base_19|) 0) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc213#1.base_19| v_ArrVal_132) |v_ULTIMATE.start_main_#t~malloc214#1.base_19| v_ArrVal_131) |v_ULTIMATE.start_main_#t~malloc213#1.base_19| 0) |v_ULTIMATE.start_main_#t~malloc214#1.base_19| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc213#1.base_19| v_ArrVal_133) |v_ULTIMATE.start_main_#t~malloc214#1.base_19|) 0))) is different from true [2022-11-20 19:43:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 19:43:08,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 19:43:08,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386774689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:43:08,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 19:43:08,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2022-11-20 19:43:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933707438] [2022-11-20 19:43:08,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:43:08,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 19:43:08,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:43:08,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 19:43:08,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2022-11-20 19:43:08,126 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:08,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:43:08,130 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-11-20 19:43:08,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 19:43:08,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 19:43:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:43:08,131 INFO L225 Difference]: With dead ends: 25 [2022-11-20 19:43:08,131 INFO L226 Difference]: Without dead ends: 23 [2022-11-20 19:43:08,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2022-11-20 19:43:08,132 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 19:43:08,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 13 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-11-20 19:43:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-20 19:43:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-20 19:43:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-11-20 19:43:08,135 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 9 [2022-11-20 19:43:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:43:08,135 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-11-20 19:43:08,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-11-20 19:43:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 19:43:08,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:43:08,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:43:08,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 19:43:08,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:43:08,342 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:43:08,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:43:08,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1632509461, now seen corresponding path program 1 times [2022-11-20 19:43:08,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:43:08,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820612471] [2022-11-20 19:43:08,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:08,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:43:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:09,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:43:09,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820612471] [2022-11-20 19:43:09,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820612471] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:43:09,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711714701] [2022-11-20 19:43:09,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:09,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:43:09,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:43:09,047 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:43:09,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 19:43:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:09,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-20 19:43:09,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:43:09,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:09,169 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-11-20 19:43:09,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 19:43:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:09,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:43:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:10,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711714701] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:43:10,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [116831822] [2022-11-20 19:43:10,558 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 19:43:10,558 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:43:10,559 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:43:10,559 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:43:10,559 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:43:10,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:10,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 19:43:10,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-20 19:43:10,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:43:10,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:10,754 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:43:10,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 31 [2022-11-20 19:43:10,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:10,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:10,916 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 19:43:10,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 47 [2022-11-20 19:43:11,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 19:43:11,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 19:43:11,268 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:43:14,279 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '910#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.base|) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post210#1.base|) (+ |ULTIMATE.start_cstrncpy_#t~post210#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc213#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~us~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_#t~malloc214#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~n#1|) (<= 0 |ULTIMATE.start_main_#t~malloc214#1.base|) (<= 1 |ULTIMATE.start_cstrncpy_#t~post210#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.base|) (= |ULTIMATE.start_main_#t~malloc213#1.offset| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~n2~0#1| 2147483645) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= |ULTIMATE.start_cstrncpy_~src~0#1.offset| 1) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~dst~0#1.offset| 1) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (<= 2 |ULTIMATE.start_cstrncpy_~us~0#1.offset|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#t~post210#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-20 19:43:14,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 19:43:14,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:43:14,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-20 19:43:14,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457412712] [2022-11-20 19:43:14,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:43:14,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 19:43:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:43:14,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 19:43:14,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2022-11-20 19:43:14,281 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:43:17,627 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-11-20 19:43:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 19:43:17,628 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 19:43:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:43:17,628 INFO L225 Difference]: With dead ends: 73 [2022-11-20 19:43:17,629 INFO L226 Difference]: Without dead ends: 73 [2022-11-20 19:43:17,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=625, Invalid=3931, Unknown=0, NotChecked=0, Total=4556 [2022-11-20 19:43:17,634 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 269 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 19:43:17,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 45 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 19:43:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-20 19:43:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 39. [2022-11-20 19:43:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-11-20 19:43:17,644 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 12 [2022-11-20 19:43:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:43:17,644 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-11-20 19:43:17,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-11-20 19:43:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 19:43:17,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:43:17,645 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1] [2022-11-20 19:43:17,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 19:43:17,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:43:17,852 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:43:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:43:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1926637677, now seen corresponding path program 2 times [2022-11-20 19:43:17,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:43:17,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181527613] [2022-11-20 19:43:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:17,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:43:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:18,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:43:18,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181527613] [2022-11-20 19:43:18,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181527613] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:43:18,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272100367] [2022-11-20 19:43:18,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 19:43:18,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:43:18,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:43:18,523 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:43:18,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 19:43:18,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 19:43:18,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 19:43:18,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-20 19:43:18,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:43:18,648 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 19:43:18,648 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-11-20 19:43:18,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 10 treesize of output 8 [2022-11-20 19:43:18,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 19:43:18,847 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-11-20 19:43:19,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:19,038 INFO L321 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-11-20 19:43:19,038 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 27 treesize of output 23 [2022-11-20 19:43:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:19,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:43:19,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:43:19,666 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-11-20 19:43:19,688 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2022-11-20 19:43:19,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 26 treesize of output 31 [2022-11-20 19:43:19,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:43:19,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:43:19,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2022-11-20 19:43:19,720 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-11-20 19:43:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:19,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272100367] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:43:19,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [682169457] [2022-11-20 19:43:19,822 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-20 19:43:19,822 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:43:19,823 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:43:19,823 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:43:19,823 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:43:19,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:19,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 19:43:19,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-20 19:43:20,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:43:20,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:20,036 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:43:20,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 31 [2022-11-20 19:43:20,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:20,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:20,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:43:20,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:20,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:20,226 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:43:20,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-11-20 19:43:20,356 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 19:43:20,357 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-11-20 19:43:20,482 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:43:21,793 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1182#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)) (<= 0 |#NULL.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.base|) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|)) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc213#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_main_#t~malloc214#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc214#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.base|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= |ULTIMATE.start_main_#t~malloc213#1.offset| 0) (<= |#NULL.base| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc214#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc213#1.offset|) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-20 19:43:21,793 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 19:43:21,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:43:21,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-11-20 19:43:21,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242602312] [2022-11-20 19:43:21,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:43:21,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 19:43:21,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:43:21,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 19:43:21,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2022-11-20 19:43:21,796 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:43:22,822 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-11-20 19:43:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 19:43:22,822 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 19:43:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:43:22,823 INFO L225 Difference]: With dead ends: 43 [2022-11-20 19:43:22,823 INFO L226 Difference]: Without dead ends: 43 [2022-11-20 19:43:22,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=226, Invalid=1936, Unknown=0, NotChecked=0, Total=2162 [2022-11-20 19:43:22,824 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:43:22,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 188 Invalid, 0 Unknown, 87 Unchecked, 0.2s Time] [2022-11-20 19:43:22,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-20 19:43:22,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-11-20 19:43:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.236842105263158) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-11-20 19:43:22,828 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 12 [2022-11-20 19:43:22,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:43:22,828 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-11-20 19:43:22,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-11-20 19:43:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 19:43:22,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:43:22,829 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:43:22,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 19:43:23,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 19:43:23,036 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:43:23,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:43:23,036 INFO L85 PathProgramCache]: Analyzing trace with hash 931812961, now seen corresponding path program 1 times [2022-11-20 19:43:23,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:43:23,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977725216] [2022-11-20 19:43:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:23,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:43:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 19:43:23,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:43:23,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977725216] [2022-11-20 19:43:23,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977725216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:43:23,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:43:23,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 19:43:23,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049431141] [2022-11-20 19:43:23,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:43:23,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 19:43:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:43:23,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 19:43:23,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 19:43:23,262 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:43:23,320 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-11-20 19:43:23,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:43:23,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 19:43:23,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:43:23,322 INFO L225 Difference]: With dead ends: 40 [2022-11-20 19:43:23,322 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 19:43:23,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-20 19:43:23,324 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 19:43:23,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 12 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 19:43:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 19:43:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-11-20 19:43:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-11-20 19:43:23,329 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 13 [2022-11-20 19:43:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:43:23,329 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-11-20 19:43:23,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-11-20 19:43:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 19:43:23,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:43:23,332 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:43:23,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 19:43:23,332 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:43:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:43:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash 919979883, now seen corresponding path program 2 times [2022-11-20 19:43:23,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:43:23,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369728414] [2022-11-20 19:43:23,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:23,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:43:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:24,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:43:24,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369728414] [2022-11-20 19:43:24,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369728414] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:43:24,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664639856] [2022-11-20 19:43:24,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 19:43:24,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:43:24,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:43:24,423 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:43:24,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 19:43:24,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 19:43:24,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 19:43:24,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-20 19:43:24,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:43:24,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:24,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-20 19:43:24,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 19:43:25,720 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:25,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:43:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:26,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664639856] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:43:26,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1915611363] [2022-11-20 19:43:26,804 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 19:43:26,805 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:43:26,805 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:43:26,805 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:43:26,805 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:43:26,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:26,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 19:43:26,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-20 19:43:26,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:43:26,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:26,993 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:43:26,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 31 [2022-11-20 19:43:27,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:27,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:27,119 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:43:27,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 43 [2022-11-20 19:43:27,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 19:43:27,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 19:43:27,425 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:43:31,068 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1522#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.base|) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post210#1.base|) (+ |ULTIMATE.start_cstrncpy_#t~post210#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc213#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~us~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_#t~malloc214#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~n#1|) (<= 0 |ULTIMATE.start_main_#t~malloc214#1.base|) (<= 1 |ULTIMATE.start_cstrncpy_#t~post210#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.base|) (= |ULTIMATE.start_main_#t~malloc213#1.offset| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~n2~0#1| 2147483645) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= |ULTIMATE.start_cstrncpy_~src~0#1.offset| 1) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~dst~0#1.offset| 1) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (<= 2 |ULTIMATE.start_cstrncpy_~us~0#1.offset|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#t~post210#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-20 19:43:31,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 19:43:31,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:43:31,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 41 [2022-11-20 19:43:31,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535860751] [2022-11-20 19:43:31,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:43:31,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-20 19:43:31,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:43:31,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-20 19:43:31,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2461, Unknown=0, NotChecked=0, Total=2652 [2022-11-20 19:43:31,071 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:43:41,816 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-11-20 19:43:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-20 19:43:41,817 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 19:43:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:43:41,817 INFO L225 Difference]: With dead ends: 87 [2022-11-20 19:43:41,817 INFO L226 Difference]: Without dead ends: 87 [2022-11-20 19:43:41,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=1094, Invalid=8608, Unknown=0, NotChecked=0, Total=9702 [2022-11-20 19:43:41,820 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 222 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 19:43:41,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 29 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 19:43:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-20 19:43:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 55. [2022-11-20 19:43:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-11-20 19:43:41,824 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 18 [2022-11-20 19:43:41,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:43:41,825 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-11-20 19:43:41,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-11-20 19:43:41,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 19:43:41,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:43:41,826 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-20 19:43:41,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 19:43:42,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 19:43:42,032 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:43:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:43:42,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1058685462, now seen corresponding path program 1 times [2022-11-20 19:43:42,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:43:42,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535043668] [2022-11-20 19:43:42,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:42,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:43:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:42,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:43:42,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535043668] [2022-11-20 19:43:42,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535043668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:43:42,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35565492] [2022-11-20 19:43:42,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:42,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:43:42,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:43:42,843 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:43:42,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 19:43:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:42,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-20 19:43:42,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:43:42,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:42,996 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-11-20 19:43:43,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 19:43:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:44,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:43:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:44,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35565492] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:43:44,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1131535836] [2022-11-20 19:43:44,932 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 19:43:44,932 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:43:44,933 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:43:44,933 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:43:44,933 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:43:44,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:44,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 19:43:45,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-20 19:43:45,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:43:45,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:45,107 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:43:45,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 31 [2022-11-20 19:43:45,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:45,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:45,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:45,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:45,246 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:43:45,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2022-11-20 19:43:45,357 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 19:43:45,357 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-11-20 19:43:45,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 19:43:45,608 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-20 19:43:45,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 113 [2022-11-20 19:43:45,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 19:43:45,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 19:43:45,930 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:43:48,954 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1917#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.base|) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post210#1.base|) (+ |ULTIMATE.start_cstrncpy_#t~post210#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc213#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~us~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_#t~malloc214#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc214#1.base|) (<= 1 |ULTIMATE.start_cstrncpy_#t~post210#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.base|) (= |ULTIMATE.start_main_#t~malloc213#1.offset| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~n2~0#1| 2147483645) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (<= 2 |ULTIMATE.start_cstrncpy_~us~0#1.offset|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#t~post210#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-20 19:43:48,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 19:43:48,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:43:48,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 40 [2022-11-20 19:43:48,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399864221] [2022-11-20 19:43:48,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:43:48,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 19:43:48,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:43:48,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 19:43:48,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2340, Unknown=0, NotChecked=0, Total=2550 [2022-11-20 19:43:48,957 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 42 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:43:54,408 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-11-20 19:43:54,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 19:43:54,409 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 19:43:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:43:54,410 INFO L225 Difference]: With dead ends: 82 [2022-11-20 19:43:54,410 INFO L226 Difference]: Without dead ends: 46 [2022-11-20 19:43:54,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=939, Invalid=6717, Unknown=0, NotChecked=0, Total=7656 [2022-11-20 19:43:54,412 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 211 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 19:43:54,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 40 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 19:43:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-20 19:43:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-20 19:43:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 45 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-11-20 19:43:54,415 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 19 [2022-11-20 19:43:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:43:54,416 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-11-20 19:43:54,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:43:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-11-20 19:43:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 19:43:54,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:43:54,417 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1] [2022-11-20 19:43:54,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 19:43:54,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 19:43:54,623 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:43:54,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:43:54,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1497703393, now seen corresponding path program 3 times [2022-11-20 19:43:54,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:43:54,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55818256] [2022-11-20 19:43:54,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:43:54,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:43:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:43:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:55,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:43:55,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55818256] [2022-11-20 19:43:55,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55818256] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:43:55,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621143804] [2022-11-20 19:43:55,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 19:43:55,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:43:55,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:43:55,679 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:43:55,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 19:43:55,816 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 19:43:55,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 19:43:55,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 103 conjunts are in the unsatisfiable core [2022-11-20 19:43:55,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:43:55,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 19:43:55,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 19:43:56,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-20 19:43:56,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-20 19:43:56,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-20 19:43:57,023 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-20 19:43:57,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 39 [2022-11-20 19:43:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:57,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:43:58,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:43:58,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 60 [2022-11-20 19:43:58,951 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2022-11-20 19:43:58,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 26 treesize of output 31 [2022-11-20 19:43:58,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:43:58,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:43:58,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 89 [2022-11-20 19:43:59,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-20 19:43:59,045 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-11-20 19:43:59,049 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-11-20 19:43:59,054 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-11-20 19:43:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:43:59,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621143804] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:43:59,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1055297282] [2022-11-20 19:43:59,123 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-20 19:43:59,123 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:43:59,123 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:43:59,123 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:43:59,124 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:43:59,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:59,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 19:43:59,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-20 19:43:59,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:43:59,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:59,269 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:43:59,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 31 [2022-11-20 19:43:59,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:59,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:59,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:59,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:43:59,376 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:43:59,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-11-20 19:43:59,494 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 19:43:59,494 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-11-20 19:43:59,581 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:44:01,076 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2295#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.base|) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|)) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc213#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_#t~malloc214#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc214#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.base|) (= |ULTIMATE.start_main_#t~malloc213#1.offset| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-20 19:44:01,076 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 19:44:01,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:44:01,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 51 [2022-11-20 19:44:01,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924277220] [2022-11-20 19:44:01,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:44:01,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-20 19:44:01,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:44:01,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-20 19:44:01,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3167, Unknown=11, NotChecked=0, Total=3422 [2022-11-20 19:44:01,079 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 53 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:44:12,592 WARN L233 SmtUtils]: Spent 10.36s on a formula simplification. DAG size of input: 93 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 19:44:23,093 WARN L233 SmtUtils]: Spent 10.38s on a formula simplification. DAG size of input: 88 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 19:44:38,139 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 69 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 19:44:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:44:39,164 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-11-20 19:44:39,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 19:44:39,164 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 19:44:39,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:44:39,165 INFO L225 Difference]: With dead ends: 58 [2022-11-20 19:44:39,165 INFO L226 Difference]: Without dead ends: 58 [2022-11-20 19:44:39,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=524, Invalid=6099, Unknown=19, NotChecked=0, Total=6642 [2022-11-20 19:44:39,167 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 19:44:39,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 73 Unchecked, 0.0s Time] [2022-11-20 19:44:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-20 19:44:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-20 19:44:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 57 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:44:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2022-11-20 19:44:39,171 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 20 [2022-11-20 19:44:39,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:44:39,172 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2022-11-20 19:44:39,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:44:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2022-11-20 19:44:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 19:44:39,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:44:39,173 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:44:39,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 19:44:39,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 19:44:39,384 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:44:39,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:44:39,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1087320683, now seen corresponding path program 3 times [2022-11-20 19:44:39,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:44:39,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332784065] [2022-11-20 19:44:39,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:44:39,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:44:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:44:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:44:41,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:44:41,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332784065] [2022-11-20 19:44:41,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332784065] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:44:41,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596053339] [2022-11-20 19:44:41,590 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 19:44:41,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:44:41,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:44:41,595 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:44:41,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 19:44:41,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 19:44:41,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 19:44:41,714 WARN L261 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 144 conjunts are in the unsatisfiable core [2022-11-20 19:44:41,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:44:41,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:44:41,743 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-11-20 19:44:41,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-20 19:44:45,067 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-11-20 19:44:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:44:45,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:44:48,666 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-11-20 19:44:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:44:48,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596053339] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:44:48,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1696748210] [2022-11-20 19:44:48,805 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 19:44:48,805 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:44:48,806 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:44:48,806 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:44:48,806 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:44:48,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:44:48,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 19:44:48,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-20 19:44:48,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:44:48,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:44:48,980 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:44:48,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 31 [2022-11-20 19:44:49,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:44:49,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:44:49,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:44:49,107 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 19:44:49,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2022-11-20 19:44:49,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 19:44:49,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 19:44:49,384 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:44:54,061 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2704#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.base|) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post210#1.base|) (+ |ULTIMATE.start_cstrncpy_#t~post210#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc213#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~us~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_#t~malloc214#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~n#1|) (<= 0 |ULTIMATE.start_main_#t~malloc214#1.base|) (<= 1 |ULTIMATE.start_cstrncpy_#t~post210#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.base|) (= |ULTIMATE.start_main_#t~malloc213#1.offset| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~n2~0#1| 2147483645) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= |ULTIMATE.start_cstrncpy_~src~0#1.offset| 1) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~dst~0#1.offset| 1) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (<= 2 |ULTIMATE.start_cstrncpy_~us~0#1.offset|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#t~post210#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-20 19:44:54,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 19:44:54,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:44:54,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 65 [2022-11-20 19:44:54,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504118025] [2022-11-20 19:44:54,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:44:54,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-20 19:44:54,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:44:54,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-20 19:44:54,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=5186, Unknown=0, NotChecked=0, Total=5700 [2022-11-20 19:44:54,065 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 67 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:45:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:45:22,772 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2022-11-20 19:45:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-20 19:45:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 0 states have call successors, (0), 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 30 [2022-11-20 19:45:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:45:22,773 INFO L225 Difference]: With dead ends: 106 [2022-11-20 19:45:22,774 INFO L226 Difference]: Without dead ends: 106 [2022-11-20 19:45:22,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4189 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=3074, Invalid=19576, Unknown=0, NotChecked=0, Total=22650 [2022-11-20 19:45:22,778 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 280 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 19:45:22,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 28 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 19:45:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-20 19:45:22,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-20 19:45:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.0288461538461537) internal successors, (107), 105 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:45:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2022-11-20 19:45:22,784 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 30 [2022-11-20 19:45:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:45:22,784 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2022-11-20 19:45:22,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:45:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2022-11-20 19:45:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 19:45:22,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:45:22,786 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1] [2022-11-20 19:45:22,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 19:45:22,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:45:22,992 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:45:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:45:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash -903897110, now seen corresponding path program 4 times [2022-11-20 19:45:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:45:22,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829757863] [2022-11-20 19:45:22,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:45:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:45:25,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:45:25,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829757863] [2022-11-20 19:45:25,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829757863] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:45:25,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100206723] [2022-11-20 19:45:25,260 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 19:45:25,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:45:25,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:45:25,261 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:45:25,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 19:45:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:25,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 149 conjunts are in the unsatisfiable core [2022-11-20 19:45:25,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:45:25,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 19:45:25,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 19:45:25,760 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-11-20 19:45:26,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-20 19:45:26,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-20 19:45:27,362 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-11-20 19:45:28,020 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-11-20 19:45:28,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2022-11-20 19:45:29,362 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2022-11-20 19:45:29,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 63 [2022-11-20 19:45:29,369 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-20 19:45:29,381 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-20 19:45:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:45:29,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:45:36,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-20 19:45:36,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:45:36,737 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 152 treesize of output 96 [2022-11-20 19:45:36,744 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 163 treesize of output 149 [2022-11-20 19:45:36,749 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-11-20 19:45:36,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 114 [2022-11-20 19:45:36,803 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-11-20 19:45:36,810 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-11-20 19:45:36,816 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-11-20 19:45:36,821 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-11-20 19:45:36,826 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-11-20 19:45:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:45:37,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100206723] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:45:37,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1842961096] [2022-11-20 19:45:37,035 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-20 19:45:37,036 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:45:37,036 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:45:37,036 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:45:37,036 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:45:37,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:37,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 19:45:37,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-20 19:45:37,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:45:37,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:37,191 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:45:37,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 31 [2022-11-20 19:45:37,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:37,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:37,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:45:37,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:37,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:37,303 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:45:37,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 54 [2022-11-20 19:45:37,391 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 19:45:37,391 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-11-20 19:45:37,477 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:45:39,877 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3347#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.base|) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|)) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc213#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_#t~malloc214#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc214#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.base|) (= |ULTIMATE.start_main_#t~malloc213#1.offset| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_~dst~0#1.offset|) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-20 19:45:39,877 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 19:45:39,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:45:39,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 30, 30] total 84 [2022-11-20 19:45:39,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495381380] [2022-11-20 19:45:39,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:45:39,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-11-20 19:45:39,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:45:39,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-11-20 19:45:39,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=7812, Unknown=60, NotChecked=0, Total=8372 [2022-11-20 19:45:39,880 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:46:48,480 WARN L233 SmtUtils]: Spent 1.06m on a formula simplification. DAG size of input: 189 DAG size of output: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 19:47:51,643 WARN L233 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 184 DAG size of output: 170 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 19:48:35,406 WARN L233 SmtUtils]: Spent 38.23s on a formula simplification. DAG size of input: 153 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 19:48:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:48:50,072 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-11-20 19:48:50,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-20 19:48:50,073 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 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 32 [2022-11-20 19:48:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:48:50,074 INFO L225 Difference]: With dead ends: 130 [2022-11-20 19:48:50,074 INFO L226 Difference]: Without dead ends: 130 [2022-11-20 19:48:50,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3744 ImplicationChecksByTransitivity, 203.2s TimeCoverageRelationStatistics Valid=1446, Invalid=17609, Unknown=127, NotChecked=0, Total=19182 [2022-11-20 19:48:50,076 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:48:50,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 112 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 160 Unchecked, 0.1s Time] [2022-11-20 19:48:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-20 19:48:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-20 19:48:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.0234375) internal successors, (131), 129 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:48:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2022-11-20 19:48:50,082 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 32 [2022-11-20 19:48:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:48:50,082 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2022-11-20 19:48:50,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:48:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-11-20 19:48:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 19:48:50,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:48:50,084 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1] [2022-11-20 19:48:50,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 19:48:50,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:48:50,291 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-11-20 19:48:50,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:48:50,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1145643520, now seen corresponding path program 5 times [2022-11-20 19:48:50,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:48:50,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598996523] [2022-11-20 19:48:50,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:48:50,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:48:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:48:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:48:55,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:48:55,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598996523] [2022-11-20 19:48:55,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598996523] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:48:55,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266181951] [2022-11-20 19:48:55,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 19:48:55,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:48:55,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:48:55,736 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:48:55,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27a1f430-89ad-4faf-a144-075cd99a7943/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 19:48:56,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-11-20 19:48:56,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 19:48:56,303 WARN L261 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 310 conjunts are in the unsatisfiable core [2022-11-20 19:48:56,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:48:56,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 19:48:56,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-20 19:48:56,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 19:48:56,858 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-11-20 19:48:57,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-20 19:48:58,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-20 19:48:58,953 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-11-20 19:48:59,789 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-11-20 19:49:00,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2022-11-20 19:49:01,866 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-11-20 19:49:03,004 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-11-20 19:49:04,268 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-11-20 19:49:05,662 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-11-20 19:49:07,098 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 105 treesize of output 85 [2022-11-20 19:49:08,645 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-11-20 19:49:09,962 INFO L321 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2022-11-20 19:49:09,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 13 case distinctions, treesize of input 113 treesize of output 111 [2022-11-20 19:49:09,970 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2022-11-20 19:49:10,087 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2022-11-20 19:49:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:49:10,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:56:55,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:56:55,289 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 290 treesize of output 168 [2022-11-20 19:56:55,310 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 313 treesize of output 287 [2022-11-20 19:56:55,325 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-11-20 19:56:55,335 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-11-20 19:56:55,343 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-11-20 19:56:55,350 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-11-20 19:56:55,357 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-11-20 19:56:55,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 19:56:55,372 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-11-20 19:56:55,380 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-11-20 19:56:55,388 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-11-20 19:56:55,396 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-11-20 19:56:55,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 216 [2022-11-20 19:56:55,769 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2022-11-20 19:56:55,932 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2022-11-20 19:56:56,177 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2022-11-20 19:56:56,590 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2022-11-20 19:56:56,640 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-11-20 19:56:56,676 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-11-20 19:56:56,718 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-20 19:56:56,747 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-20 19:56:56,839 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-11-20 19:56:56,847 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-11-20 19:56:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:56:57,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266181951] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:56:57,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1211209660] [2022-11-20 19:56:57,433 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-20 19:56:57,433 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:56:57,434 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:56:57,434 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:56:57,434 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:56:57,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:57,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 19:56:57,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-20 19:56:57,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:56:57,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:57,637 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:56:57,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 31 [2022-11-20 19:56:57,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:57,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:57,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:57,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:57,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:56:57,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:56:57,779 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 19:56:57,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-11-20 19:56:57,890 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 19:56:57,890 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-11-20 19:56:57,982 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:57:03,049 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4189#(and (<= |ULTIMATE.start_main_~length~0#1| 2147483647) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= |ULTIMATE.start_cstrncpy_#in~n#1| 2147483647) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.base|) (< (select |#length| |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|)) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc213#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.offset|) (= |ULTIMATE.start_main_#t~malloc214#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc214#1.base|) (= |ULTIMATE.start_cstrncpy_~src~0#1.offset| (+ 1 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|)) (<= 0 |ULTIMATE.start_cstrncpy_#t~post206#1.offset|) (<= 1 |ULTIMATE.start_cstrncpy_#in~n#1|) (<= 0 |ULTIMATE.start_cstrncpy_~s1#1.base|) (= |ULTIMATE.start_main_#t~malloc213#1.offset| 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= |ULTIMATE.start_cstrncpy_#t~post207#1.base| |ULTIMATE.start_cstrncpy_~src~0#1.base|) (<= |ULTIMATE.start_cstrncpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrncpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_cstrncpy_~s2#1.offset|) (= |ULTIMATE.start_cstrncpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrncpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrncpy_#t~post207#1.offset|) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s2#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|) (<= |ULTIMATE.start_cstrncpy_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrncpy_#t~post206#1.base| |ULTIMATE.start_cstrncpy_~dst~0#1.base|) (<= |ULTIMATE.start_cstrncpy_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrncpy_~n#1| 2147483646) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (< 0 (+ |ULTIMATE.start_cstrncpy_~n#1| 1)) (= |#NULL.base| 0))' at error location [2022-11-20 19:57:03,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 19:57:03,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:57:03,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 54, 54] total 150 [2022-11-20 19:57:03,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496923189] [2022-11-20 19:57:03,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:57:03,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 152 states [2022-11-20 19:57:03,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:57:03,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2022-11-20 19:57:03,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1337, Invalid=22819, Unknown=650, NotChecked=0, Total=24806 [2022-11-20 19:57:03,056 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand has 152 states, 151 states have (on average 1.1125827814569536) internal successors, (168), 151 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 19:57:27,360 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post207#1.base|))) (let ((.cse15 (= |c_ULTIMATE.start_cstrncpy_#t~post207#1.base| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (.cse17 (not (= |c_ULTIMATE.start_cstrncpy_#t~post207#1.base| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base|))) (.cse13 (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse14 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) (.cse18 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) (.cse9 (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse3 (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse4 (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) (.cse11 (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse10 (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse5 (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (.cse0 (= (select .cse6 |c_ULTIMATE.start_cstrncpy_#t~post207#1.offset|) 49)) (.cse12 (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_493))) (or (= 49 (select (select (store .cse1 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2)) (= 49 (select (select .cse1 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= (select (select (store .cse1 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3) 49)))) (not (<= 0 .cse3)) (<= .cse4 .cse5)) (not (= 49 (select .cse6 9))) (not (= (select .cse6 4) 49)) (or .cse0 (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_484))) (or (= 49 (select (select (store .cse7 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= 49 (select (select (store .cse7 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8)) (= 49 (select (select (store .cse7 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9)) (= 49 (select (select (store .cse7 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10)) (= 49 (select (select (store .cse7 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11)) (= (select (select (store .cse7 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3) 49) (= 49 (select (select (store .cse7 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12)) (= 49 (select (select (store .cse7 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse13)) (= 49 (select (select (store .cse7 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2)) (= 49 (select (select .cse7 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|))))) (not (<= 0 .cse13)) (<= .cse14 .cse5)) .cse15 (not (= 49 (select .cse6 (+ (- 1) |c_ULTIMATE.start_cstrncpy_#t~post207#1.offset|)))) (or (<= .cse8 .cse5) .cse0 (not (<= 0 .cse9)) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_488))) (or (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9)) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12)) (= (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11) 49) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2)) (= 49 (select (select .cse16 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))))) (or (<= (+ 18446744073709551605 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse5) (<= (+ .cse5 11) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (and .cse15 (= 49 (select .cse6 (+ (- 1) .cse5))) .cse17)) (or (<= (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse5) (not (<= 0 .cse18)) .cse0 (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_483))) (or (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2) 49) (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)) (= (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse18) 49) (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse13)) (= (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8) 49) (= (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10) 49) (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12)) (= (select (select .cse19 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 49) (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11)) (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9)))))) (= |c_ULTIMATE.start_cstrncpy_#t~post207#1.offset| 11) (= |c_ULTIMATE.start_cstrncpy_~dst~0#1.offset| 12) (or (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_491))) (or (= 49 (select (select (store .cse20 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2)) (= 49 (select (select .cse20 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= (select (select (store .cse20 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11) 49) (= 49 (select (select (store .cse20 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)) (= 49 (select (select (store .cse20 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4))))) (<= .cse9 .cse5) (not (<= 0 .cse4)) .cse0) (not (= (select .cse6 2) 49)) (not (= 49 (select .cse6 0))) (not (= 49 (select .cse6 7))) (not (= 49 (select .cse6 8))) (not (= 49 (select .cse6 6))) .cse17 (or (<= .cse12 .cse5) (not (<= 0 .cse11)) .cse0 (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_492))) (or (= 49 (select (select .cse21 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= 49 (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11)) (= 49 (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2)) (= 49 (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)))))) (or (not (<= 0 .cse8)) .cse0 (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_485))) (or (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)) (= (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9) 49) (= (select (select .cse22 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 49) (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12)) (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10)) (= (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8) 49) (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11)) (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2))))) (<= .cse18 .cse5)) (not (= 49 (select .cse6 5))) (= (+ |c_ULTIMATE.start_cstrncpy_#t~post207#1.offset| 1) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (or (<= .cse11 .cse5) .cse0 (not (<= 0 .cse2)) (forall ((v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_494))) (or (= 49 (select (select .cse23 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= 49 (select (select (store .cse23 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2)))))) (not (= 49 (select .cse6 1))) (or (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_486))) (or (= 49 (select (select (store .cse24 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12)) (= 49 (select (select (store .cse24 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)) (= 49 (select (select (store .cse24 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= 49 (select (select (store .cse24 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2)) (= 49 (select (select (store .cse24 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11)) (= 49 (select (select (store .cse24 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10)) (= 49 (select (select .cse24 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= 49 (select (select (store .cse24 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9))))) (not (<= 0 .cse10)) .cse0 (<= .cse13 .cse5)) (not (= 49 (select .cse6 3))) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| (select |c_#length| |c_ULTIMATE.start_cstrncpy_#t~post207#1.base|)) (<= 1 |ULTIMATE.start_main_~length~0#1|) (= 49 (select .cse6 (+ (- 1) |ULTIMATE.start_main_~length~0#1|))))) (or (not (<= 0 .cse14)) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_482 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_482))) (or (= 49 (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse13)) (= (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2) 49) (= 49 (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8)) (= 49 (select (select .cse25 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= 49 (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11)) (= 49 (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse14)) (= (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12) 49) (= 49 (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10)) (= 49 (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse18) 49) (= (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3) 49) (= 49 (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9))))) .cse0 (<= (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse5)) (or (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_489))) (or (= 49 (select (select .cse26 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= (select (select (store .cse26 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12) 49) (= 49 (select (select (store .cse26 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)) (= 49 (select (select (store .cse26 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= 49 (select (select (store .cse26 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2)) (= 49 (select (select (store .cse26 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11))))) (<= .cse10 .cse5) .cse0 (not (<= 0 .cse12))) (<= 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from true [2022-11-20 19:57:29,540 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) (.cse18 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) (.cse6 (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse11 (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse5 (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse3 (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) (.cse10 (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse8 (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse12 (= 49 |c_ULTIMATE.start_cstrncpy_#t~mem208#1|)) (.cse9 (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (.cse0 (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (.cse23 (not (= |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) (and (or (<= (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse0) (not (<= 0 .cse1)) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_483))) (or (= 49 (select (select (store .cse2 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)) (= (select (select (store .cse2 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4) 49) (= 49 (select (select (store .cse2 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5)) (= (select (select (store .cse2 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse1) 49) (= 49 (select (select (store .cse2 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse6)) (= (select (select (store .cse2 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse7) 49) (= (select (select (store .cse2 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8) 49) (= 49 (select (select (store .cse2 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9)) (= (select (select .cse2 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 49) (= 49 (select (select (store .cse2 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10)) (= 49 (select (select (store .cse2 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11))))) .cse12) (not (= 49 (select .cse13 9))) (or (<= .cse10 .cse0) (not (<= 0 .cse4)) .cse12 (forall ((v_ArrVal_494 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_494))) (or (= 49 (select (select .cse14 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= 49 (select (select (store .cse14 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)))))) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (= 49 (select .cse13 (+ (- 1) |ULTIMATE.start_main_~length~0#1|))) (<= |ULTIMATE.start_main_~length~0#1| .cse0) (<= 1 |ULTIMATE.start_main_~length~0#1|))) (not (= 49 (select .cse13 1))) (or (<= .cse7 .cse0) (not (<= 0 .cse11)) .cse12 (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_488))) (or (= 49 (select (select (store .cse15 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11)) (= 49 (select (select (store .cse15 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)) (= 49 (select (select (store .cse15 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5)) (= 49 (select (select (store .cse15 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9)) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10) 49) (= 49 (select (select (store .cse15 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= 49 (select (select .cse15 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))))) (= |c_ULTIMATE.start_cstrncpy_~dst~0#1.offset| 12) (or (<= .cse9 .cse0) (not (<= 0 .cse10)) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_492))) (or (= 49 (select (select .cse16 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10)) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5))))) .cse12) (or (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_484))) (or (= 49 (select (select (store .cse17 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)) (= 49 (select (select (store .cse17 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse7)) (= 49 (select (select (store .cse17 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11)) (= 49 (select (select (store .cse17 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8)) (= 49 (select (select (store .cse17 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10)) (= (select (select (store .cse17 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5) 49) (= 49 (select (select (store .cse17 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9)) (= 49 (select (select (store .cse17 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse6)) (= 49 (select (select (store .cse17 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= 49 (select (select .cse17 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|))))) (not (<= 0 .cse6)) .cse12 (<= .cse18 .cse0)) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_485))) (or (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5)) (= (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11) 49) (= (select (select .cse19 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 49) (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9)) (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)) (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8)) (= (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse7) 49) (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10)) (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4))))) (<= .cse1 .cse0) .cse12) (or (forall ((v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_493))) (or (= 49 (select (select (store .cse20 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= 49 (select (select .cse20 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= (select (select (store .cse20 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5) 49)))) (not (<= 0 .cse5)) (<= .cse3 .cse0) .cse12) (not (= (select .cse13 2) 49)) (not (= (select .cse13 7) 49)) (not (= 49 (select .cse13 3))) (not (= 49 (select .cse13 8))) (not (= 49 (select .cse13 4))) (or (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_483 (Array Int Int)) (v_ArrVal_482 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_482))) (or (= 49 (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse6)) (= (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4) 49) (= 49 (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse7)) (= 49 (select (select .cse21 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= 49 (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10)) (= 49 (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse18)) (= (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9) 49) (= 49 (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8)) (= 49 (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)) (= (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse1) 49) (= (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5) 49) (= 49 (select (select (store .cse21 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11))))) (not (<= 0 .cse18)) (<= (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse0) .cse12) (not (= 49 (select .cse13 6))) (or (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_486))) (or (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9)) (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5)) (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)) (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10)) (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8)) (= 49 (select (select .cse22 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse11))))) (not (<= 0 .cse8)) .cse12 (<= .cse6 .cse0)) .cse23 (= 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (not (= 49 (select .cse13 0))) (not (= 49 (select .cse13 5))) (not (= 49 (select .cse13 10))) (or (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_491))) (or (= 49 (select (select (store .cse24 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= 49 (select (select .cse24 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= (select (select (store .cse24 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10) 49) (= 49 (select (select (store .cse24 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5)) (= 49 (select (select (store .cse24 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3))))) (<= .cse11 .cse0) (not (<= 0 .cse3)) .cse12) (or (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post206#1.base| v_ArrVal_489))) (or (= 49 (select (select .cse25 |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (= (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9) 49) (= 49 (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse5)) (= 49 (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3)) (= 49 (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4)) (= 49 (select (select (store .cse25 |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse10))))) (<= .cse8 .cse0) .cse12 (not (<= 0 .cse9))) (<= 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (= (select .cse13 11) |c_ULTIMATE.start_cstrncpy_#t~mem208#1|) (or (<= (+ 18446744073709551605 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse0) (<= (+ .cse0 11) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (and (= 49 (select .cse13 (+ (- 1) .cse0))) .cse23)))) is different from true [2022-11-20 19:57:31,712 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) (.cse14 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) (.cse0 (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse7 (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse4 (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse6 (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse1 (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse2 (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse12 (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse8 (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (.cse5 (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (.cse10 (= 49 (select .cse13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|))) (.cse9 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) (.cse11 (= 49 |c_ULTIMATE.start_cstrncpy_#t~mem208#1|))) (and (or (forall ((v_ArrVal_493 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse0))) (forall ((v_ArrVal_492 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse1) 49)) (forall ((v_ArrVal_488 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2))) (forall ((v_ArrVal_496 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3))) (forall ((v_ArrVal_491 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4))) (<= (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse5) (forall ((v_ArrVal_485 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse6) 49)) (forall ((v_ArrVal_494 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse7))) (not (<= 0 .cse3)) (forall ((v_ArrVal_486 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8) 49)) (forall ((v_ArrVal_484 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9))) .cse10 .cse11 (forall ((v_ArrVal_489 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12)))) (not (= 49 (select .cse13 9))) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (= 49 (select .cse13 (+ (- 1) |ULTIMATE.start_main_~length~0#1|))) (<= |ULTIMATE.start_main_~length~0#1| .cse5) (<= 1 |ULTIMATE.start_main_~length~0#1|))) (or (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9) 49)) (forall ((v_ArrVal_496 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4))) (<= .cse0 .cse5) (forall ((v_ArrVal_494 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12))) (not (<= 0 .cse4)) .cse10 (forall ((v_ArrVal_492 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8))) (forall ((v_ArrVal_493 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2))) .cse11 (forall ((v_ArrVal_491 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse6)))) (not (= 49 (select .cse13 1))) (or (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9) 49)) (<= .cse12 .cse5) (not (<= 0 .cse8)) (forall ((v_ArrVal_496 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8))) (forall ((v_ArrVal_494 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse6) 49)) .cse10 .cse11) (= |c_ULTIMATE.start_cstrncpy_~dst~0#1.offset| 12) (or (forall ((v_ArrVal_493 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse1))) (forall ((v_ArrVal_496 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse7))) (forall ((v_ArrVal_494 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse0))) (forall ((v_ArrVal_488 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8))) (forall ((v_ArrVal_485 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9) 49)) (forall ((v_ArrVal_489 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2))) .cse10 (not (<= 0 .cse7)) .cse11 (forall ((v_ArrVal_486 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse6))) (forall ((v_ArrVal_492 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4) 49)) (<= .cse14 .cse5) (forall ((v_ArrVal_491 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12)))) (not (= (select .cse13 2) 49)) (not (= (select .cse13 7) 49)) (or (forall ((v_ArrVal_486 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9))) (not (<= 0 .cse0)) (forall ((v_ArrVal_494 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse1))) (forall ((v_ArrVal_493 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4))) (forall ((v_ArrVal_491 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2))) (forall ((v_ArrVal_492 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12))) (forall ((v_ArrVal_488 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse6) 49)) (<= .cse3 .cse5) .cse10 (forall ((v_ArrVal_496 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse0) 49)) .cse11 (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8) 49))) (or (forall ((v_ArrVal_491 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse1))) (forall ((v_ArrVal_489 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4))) (not (<= 0 .cse14)) (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse7) 49)) (forall ((v_ArrVal_484 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse6))) (forall ((v_ArrVal_486 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2))) (forall ((v_ArrVal_494 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse3))) (forall ((v_ArrVal_488 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12) 49)) (forall ((v_ArrVal_496 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse14))) (forall ((v_ArrVal_483 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9))) (forall ((v_ArrVal_485 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8) 49)) (<= (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse5) .cse10 (forall ((v_ArrVal_492 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse0))) .cse11) (or (forall ((v_ArrVal_491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8) 49)) (forall ((v_ArrVal_496 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse1))) (not (<= 0 .cse1)) (forall ((v_ArrVal_494 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse4))) (forall ((v_ArrVal_489 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse6) 49)) (forall ((v_ArrVal_492 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2))) .cse10 .cse11 (forall ((v_ArrVal_493 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12))) (<= .cse7 .cse5) (forall ((v_ArrVal_488 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9) 49))) (not (= 49 (select .cse13 3))) (not (= 49 (select .cse13 8))) (not (= 49 (select .cse13 4))) (not (= 49 (select .cse13 6))) (or (forall ((v_ArrVal_492 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9))) (<= .cse4 .cse5) (not (<= 0 .cse2)) (forall ((v_ArrVal_494 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8))) .cse10 .cse11 (forall ((v_ArrVal_493 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse6))) (forall ((v_ArrVal_496 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2)))) (= 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (not (= 49 (select .cse13 0))) (or (= 49 (select .cse13 (+ (- 1) .cse5))) (<= (+ 18446744073709551605 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse5) (<= (+ .cse5 11) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (= 49 (select .cse13 5))) (not (= 49 (select .cse13 10))) (or (forall ((v_ArrVal_494 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9))) (forall ((v_ArrVal_496 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse6))) .cse10 (not (<= 0 .cse6)) (<= .cse2 .cse5) .cse11) (or (forall ((v_ArrVal_492 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_492) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse6))) (forall ((v_ArrVal_493 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse8) 49)) (forall ((v_ArrVal_491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9) 49)) (<= .cse1 .cse5) (forall ((v_ArrVal_496 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse12) 49)) .cse10 .cse11 (forall ((v_ArrVal_494 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse2) 49)) (not (<= 0 .cse12))) (<= 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (= (select .cse13 11) |c_ULTIMATE.start_cstrncpy_#t~mem208#1|) (or (<= .cse8 .cse5) (not (<= 0 .cse9)) .cse10 (forall ((v_ArrVal_496 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_496) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) .cse9))) .cse11)))) is different from true