./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 624eab544b12ce67976c98f49727abb376f7f963832aa58f07a7fb9fd050787e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 07:05:17,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:05:17,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:05:17,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:05:17,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:05:17,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:05:17,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:05:17,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:05:17,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:05:17,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:05:17,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:05:17,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:05:17,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:05:17,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:05:17,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:05:17,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:05:17,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:05:17,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:05:17,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:05:17,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:05:17,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:05:17,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:05:17,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:05:17,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:05:17,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:05:17,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:05:17,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:05:17,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:05:17,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:05:17,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:05:17,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:05:17,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:05:17,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:05:17,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:05:17,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:05:17,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:05:17,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:05:17,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:05:17,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:05:17,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:05:17,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:05:17,309 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-12-14 07:05:17,325 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:05:17,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:05:17,325 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:05:17,326 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:05:17,326 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:05:17,326 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:05:17,326 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:05:17,326 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:05:17,327 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:05:17,327 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:05:17,327 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:05:17,327 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:05:17,327 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:05:17,327 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:05:17,327 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:05:17,327 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:05:17,328 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:05:17,328 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:05:17,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 07:05:17,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 07:05:17,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:05:17,329 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 07:05:17,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:05:17,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:05:17,329 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 07:05:17,329 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 07:05:17,329 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 07:05:17,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:05:17,329 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 07:05:17,329 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:05:17,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:05:17,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:05:17,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:05:17,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:05:17,330 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:05:17,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:05:17,330 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:05:17,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:05:17,331 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:05:17,331 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_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 624eab544b12ce67976c98f49727abb376f7f963832aa58f07a7fb9fd050787e [2022-12-14 07:05:17,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:05:17,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:05:17,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:05:17,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:05:17,530 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:05:17,531 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i [2022-12-14 07:05:20,173 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:05:20,313 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:05:20,314 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i [2022-12-14 07:05:20,322 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/data/c549e5f63/e8190b49f5a64fbea4435263eaac6082/FLAGd57252dee [2022-12-14 07:05:20,335 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/data/c549e5f63/e8190b49f5a64fbea4435263eaac6082 [2022-12-14 07:05:20,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:05:20,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:05:20,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:05:20,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:05:20,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:05:20,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:05:20" (1/1) ... [2022-12-14 07:05:20,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8c762c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20, skipping insertion in model container [2022-12-14 07:05:20,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:05:20" (1/1) ... [2022-12-14 07:05:20,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:05:20,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:05:20,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:05:20,550 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:05:20,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:05:20,590 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:05:20,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20 WrapperNode [2022-12-14 07:05:20,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:05:20,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:05:20,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:05:20,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:05:20,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20" (1/1) ... [2022-12-14 07:05:20,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20" (1/1) ... [2022-12-14 07:05:20,618 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2022-12-14 07:05:20,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:05:20,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:05:20,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:05:20,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:05:20,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20" (1/1) ... [2022-12-14 07:05:20,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20" (1/1) ... [2022-12-14 07:05:20,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20" (1/1) ... [2022-12-14 07:05:20,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20" (1/1) ... [2022-12-14 07:05:20,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20" (1/1) ... [2022-12-14 07:05:20,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20" (1/1) ... [2022-12-14 07:05:20,633 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20" (1/1) ... [2022-12-14 07:05:20,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20" (1/1) ... [2022-12-14 07:05:20,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:05:20,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:05:20,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:05:20,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:05:20,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20" (1/1) ... [2022-12-14 07:05:20,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:05:20,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:05:20,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:05:20,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:05:20,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 07:05:20,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 07:05:20,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 07:05:20,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:05:20,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:05:20,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:05:20,769 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:05:20,771 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:05:20,897 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:05:20,923 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:05:20,923 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 07:05:20,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:05:20 BoogieIcfgContainer [2022-12-14 07:05:20,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:05:20,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:05:20,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:05:20,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:05:20,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:05:20" (1/3) ... [2022-12-14 07:05:20,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6e7458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:05:20, skipping insertion in model container [2022-12-14 07:05:20,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:05:20" (2/3) ... [2022-12-14 07:05:20,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6e7458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:05:20, skipping insertion in model container [2022-12-14 07:05:20,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:05:20" (3/3) ... [2022-12-14 07:05:20,932 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-2.i [2022-12-14 07:05:20,946 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:05:20,946 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-12-14 07:05:20,990 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:05:20,996 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;@22eb288a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:05:20,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-14 07:05:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 9 states have (on average 2.111111111111111) 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-12-14 07:05:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 07:05:21,008 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:21,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 07:05:21,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:05:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash 85142, now seen corresponding path program 1 times [2022-12-14 07:05:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:21,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270754436] [2022-12-14 07:05:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:21,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:21,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270754436] [2022-12-14 07:05:21,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270754436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:05:21,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:05:21,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:05:21,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244127303] [2022-12-14 07:05:21,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:05:21,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:05:21,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:21,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:05:21,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:05:21,167 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 2.111111111111111) 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:21,198 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-12-14 07:05:21,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:05:21,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 07:05:21,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:21,206 INFO L225 Difference]: With dead ends: 18 [2022-12-14 07:05:21,206 INFO L226 Difference]: Without dead ends: 16 [2022-12-14 07:05:21,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:05:21,210 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:21,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:05:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-12-14 07:05:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-12-14 07:05:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-12-14 07:05:21,232 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 3 [2022-12-14 07:05:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:21,233 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-12-14 07:05:21,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-12-14 07:05:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 07:05:21,233 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:21,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 07:05:21,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 07:05:21,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:05:21,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:21,234 INFO L85 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2022-12-14 07:05:21,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:21,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457181473] [2022-12-14 07:05:21,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:21,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:21,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:21,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457181473] [2022-12-14 07:05:21,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457181473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:05:21,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:05:21,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:05:21,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679342585] [2022-12-14 07:05:21,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:05:21,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:05:21,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:21,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:05:21,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:05:21,313 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:21,332 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-12-14 07:05:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:05:21,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 07:05:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:21,333 INFO L225 Difference]: With dead ends: 15 [2022-12-14 07:05:21,333 INFO L226 Difference]: Without dead ends: 15 [2022-12-14 07:05:21,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:05:21,335 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:21,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 7 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:05:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-12-14 07:05:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-12-14 07:05:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-12-14 07:05:21,339 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 3 [2022-12-14 07:05:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:21,339 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-12-14 07:05:21,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-12-14 07:05:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 07:05:21,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:21,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 07:05:21,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 07:05:21,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:05:21,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash 85179, now seen corresponding path program 1 times [2022-12-14 07:05:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:21,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341156959] [2022-12-14 07:05:21,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:21,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:21,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:21,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341156959] [2022-12-14 07:05:21,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341156959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:05:21,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:05:21,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:05:21,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690503210] [2022-12-14 07:05:21,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:05:21,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:05:21,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:21,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:05:21,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:05:21,546 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:21,567 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-12-14 07:05:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:05:21,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 07:05:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:21,569 INFO L225 Difference]: With dead ends: 14 [2022-12-14 07:05:21,569 INFO L226 Difference]: Without dead ends: 14 [2022-12-14 07:05:21,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:05:21,570 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:21,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:05:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-12-14 07:05:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-12-14 07:05:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-12-14 07:05:21,572 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 3 [2022-12-14 07:05:21,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:21,572 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-12-14 07:05:21,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-12-14 07:05:21,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 07:05:21,573 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:21,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 07:05:21,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 07:05:21,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:05:21,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:21,574 INFO L85 PathProgramCache]: Analyzing trace with hash 81885786, now seen corresponding path program 1 times [2022-12-14 07:05:21,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:21,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594296552] [2022-12-14 07:05:21,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:21,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:21,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:21,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594296552] [2022-12-14 07:05:21,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594296552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:05:21,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:05:21,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:05:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859335688] [2022-12-14 07:05:21,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:05:21,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:05:21,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:21,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:05:21,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:05:21,637 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:21,668 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-12-14 07:05:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:05:21,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 07:05:21,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:21,669 INFO L225 Difference]: With dead ends: 13 [2022-12-14 07:05:21,670 INFO L226 Difference]: Without dead ends: 13 [2022-12-14 07:05:21,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:05:21,671 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:21,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:05:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-12-14 07:05:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-12-14 07:05:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-12-14 07:05:21,674 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2022-12-14 07:05:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:21,674 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-12-14 07:05:21,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-12-14 07:05:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 07:05:21,674 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:21,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 07:05:21,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 07:05:21,675 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:05:21,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:21,675 INFO L85 PathProgramCache]: Analyzing trace with hash 81885787, now seen corresponding path program 1 times [2022-12-14 07:05:21,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:21,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539218911] [2022-12-14 07:05:21,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:21,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:21,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539218911] [2022-12-14 07:05:21,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539218911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:05:21,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:05:21,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:05:21,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374047393] [2022-12-14 07:05:21,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:05:21,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:05:21,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:21,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:05:21,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:05:21,764 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:21,807 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-12-14 07:05:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:05:21,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 07:05:21,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:21,808 INFO L225 Difference]: With dead ends: 19 [2022-12-14 07:05:21,808 INFO L226 Difference]: Without dead ends: 19 [2022-12-14 07:05:21,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:05:21,808 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:21,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:05:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-12-14 07:05:21,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2022-12-14 07:05:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-12-14 07:05:21,811 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 5 [2022-12-14 07:05:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:21,811 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-12-14 07:05:21,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-12-14 07:05:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 07:05:21,812 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:21,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 07:05:21,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 07:05:21,812 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:05:21,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1756507928, now seen corresponding path program 1 times [2022-12-14 07:05:21,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:21,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442058056] [2022-12-14 07:05:21,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:21,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:21,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442058056] [2022-12-14 07:05:21,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442058056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:05:21,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:05:21,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:05:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856463865] [2022-12-14 07:05:21,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:05:21,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:05:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:21,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:05:21,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:05:21,907 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:21,943 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-12-14 07:05:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:05:21,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 07:05:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:21,943 INFO L225 Difference]: With dead ends: 14 [2022-12-14 07:05:21,943 INFO L226 Difference]: Without dead ends: 14 [2022-12-14 07:05:21,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:05:21,944 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:21,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:05:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-12-14 07:05:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-12-14 07:05:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-12-14 07:05:21,946 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 6 [2022-12-14 07:05:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:21,946 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-12-14 07:05:21,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-12-14 07:05:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 07:05:21,947 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:21,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 07:05:21,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 07:05:21,947 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:05:21,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:21,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1756507927, now seen corresponding path program 1 times [2022-12-14 07:05:21,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:21,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53080849] [2022-12-14 07:05:21,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:21,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:22,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:22,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53080849] [2022-12-14 07:05:22,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53080849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:05:22,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:05:22,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:05:22,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607866131] [2022-12-14 07:05:22,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:05:22,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:05:22,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:22,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:05:22,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:05:22,088 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:22,154 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-12-14 07:05:22,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:05:22,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 07:05:22,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:22,155 INFO L225 Difference]: With dead ends: 16 [2022-12-14 07:05:22,155 INFO L226 Difference]: Without dead ends: 16 [2022-12-14 07:05:22,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:05:22,156 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:22,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 7 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:05:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-12-14 07:05:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-12-14 07:05:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-12-14 07:05:22,158 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 6 [2022-12-14 07:05:22,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:22,158 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-12-14 07:05:22,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-12-14 07:05:22,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:05:22,158 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:22,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:05:22,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 07:05:22,159 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:05:22,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:22,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1753858779, now seen corresponding path program 1 times [2022-12-14 07:05:22,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:22,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886232693] [2022-12-14 07:05:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:22,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:22,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:22,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886232693] [2022-12-14 07:05:22,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886232693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:05:22,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:05:22,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:05:22,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087803529] [2022-12-14 07:05:22,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:05:22,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:05:22,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:22,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:05:22,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:05:22,255 INFO L87 Difference]: Start difference. First operand 15 states and 15 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-12-14 07:05:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:22,268 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-12-14 07:05:22,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:05:22,269 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-12-14 07:05:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:22,269 INFO L225 Difference]: With dead ends: 14 [2022-12-14 07:05:22,269 INFO L226 Difference]: Without dead ends: 12 [2022-12-14 07:05:22,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:05:22,270 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:22,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 10 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:05:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-12-14 07:05:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-12-14 07:05:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.2) internal successors, (12), 11 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-12-14 07:05:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-12-14 07:05:22,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2022-12-14 07:05:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:22,272 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-12-14 07:05:22,272 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-12-14 07:05:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-12-14 07:05:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:05:22,272 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:22,272 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:05:22,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 07:05:22,272 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:05:22,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1753860003, now seen corresponding path program 1 times [2022-12-14 07:05:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:22,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895243071] [2022-12-14 07:05:22,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:22,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:22,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:22,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895243071] [2022-12-14 07:05:22,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895243071] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:05:22,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779601772] [2022-12-14 07:05:22,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:22,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:22,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:05:22,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:05:22,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 07:05:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:22,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 07:05:22,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:05:22,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 07:05:22,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:05:22,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2022-12-14 07:05:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:22,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:05:23,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-12-14 07:05:23,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-12-14 07:05:23,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 07:05:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:23,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779601772] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:05:23,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [20414433] [2022-12-14 07:05:23,145 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 07:05:23,145 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:05:23,153 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:05:23,159 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:05:23,159 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:05:23,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:23,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 07:05:23,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 07:05:23,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:05:23,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:23,400 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:05:23,401 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-12-14 07:05:23,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:23,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:23,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:23,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:23,541 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:05:23,541 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-12-14 07:05:23,680 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 07:05:23,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 07:05:23,799 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:05:24,455 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '374#(and (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 1 |ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~dst~0#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 1 |ULTIMATE.start_cstrcpy_~dst~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.offset|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 07:05:24,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:05:24,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:05:24,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-14 07:05:24,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940803234] [2022-12-14 07:05:24,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:05:24,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:05:24,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:24,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:05:24,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-12-14 07:05:24,457 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:24,737 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-12-14 07:05:24,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:05:24,737 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 07:05:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:24,738 INFO L225 Difference]: With dead ends: 18 [2022-12-14 07:05:24,738 INFO L226 Difference]: Without dead ends: 18 [2022-12-14 07:05:24,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2022-12-14 07:05:24,739 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:24,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 7 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:05:24,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-14 07:05:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2022-12-14 07:05:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-12-14 07:05:24,741 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 9 [2022-12-14 07:05:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:24,741 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-12-14 07:05:24,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-12-14 07:05:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 07:05:24,741 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:24,741 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 07:05:24,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 07:05:24,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-14 07:05:24,943 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:05:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:24,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1464914783, now seen corresponding path program 1 times [2022-12-14 07:05:24,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:24,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061378690] [2022-12-14 07:05:24,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:25,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:25,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061378690] [2022-12-14 07:05:25,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061378690] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:05:25,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156139028] [2022-12-14 07:05:25,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:25,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:25,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:05:25,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:05:25,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 07:05:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:25,528 WARN L261 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-14 07:05:25,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:05:25,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 07:05:25,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2022-12-14 07:05:25,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 07:05:25,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:05:25,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2022-12-14 07:05:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:26,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:05:26,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-12-14 07:05:26,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 07:05:26,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:05:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:26,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156139028] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:05:26,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [517068600] [2022-12-14 07:05:26,378 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 07:05:26,378 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:05:26,379 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:05:26,379 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:05:26,379 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:05:26,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:26,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 07:05:26,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 07:05:26,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:05:26,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:26,509 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:05:26,509 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-12-14 07:05:26,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:26,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:26,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:26,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:05:26,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:26,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:26,593 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:05:26,593 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-12-14 07:05:26,671 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 07:05:26,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 07:05:26,728 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:05:27,370 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '507#(and (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (= (select |#valid| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) 1) (= |ULTIMATE.start_cstrcpy_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) |ULTIMATE.start_cstrcpy_#t~post3#1.offset|)) (<= 0 |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 1 |ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= (+ |ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcpy_#t~post3#1.base|)) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~dst~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 1 |ULTIMATE.start_cstrcpy_~dst~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post2#1.offset| 1)) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.offset|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 07:05:27,370 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:05:27,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:05:27,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 07:05:27,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229754210] [2022-12-14 07:05:27,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:05:27,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 07:05:27,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:27,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 07:05:27,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2022-12-14 07:05:27,372 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:28,584 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-12-14 07:05:28,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 07:05:28,585 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 07:05:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:28,585 INFO L225 Difference]: With dead ends: 16 [2022-12-14 07:05:28,585 INFO L226 Difference]: Without dead ends: 16 [2022-12-14 07:05:28,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 07:05:28,586 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 62 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:28,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 3 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:05:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-12-14 07:05:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2022-12-14 07:05:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-12-14 07:05:28,588 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2022-12-14 07:05:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:28,588 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-12-14 07:05:28,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-12-14 07:05:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 07:05:28,588 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:28,588 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2022-12-14 07:05:28,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 07:05:28,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:28,790 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:05:28,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash -113626901, now seen corresponding path program 2 times [2022-12-14 07:05:28,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:28,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308612952] [2022-12-14 07:05:28,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:28,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:29,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:29,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308612952] [2022-12-14 07:05:29,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308612952] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:05:29,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278240566] [2022-12-14 07:05:29,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:05:29,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:29,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:05:29,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:05:29,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 07:05:29,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:05:29,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:05:29,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-14 07:05:29,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:05:29,324 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:05:29,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 07:05:29,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 07:05:29,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:05:29,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 07:05:29,604 INFO L321 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-12-14 07:05:29,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2022-12-14 07:05:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:29,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:05:29,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:05:29,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2022-12-14 07:05:29,984 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2022-12-14 07:05:29,985 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-12-14 07:05:29,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:05:29,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:05:29,996 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-12-14 07:05:30,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:05:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:30,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278240566] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:05:30,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1976299122] [2022-12-14 07:05:30,067 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 07:05:30,068 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:05:30,068 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:05:30,068 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:05:30,068 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:05:30,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:30,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 07:05:30,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 07:05:30,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:05:30,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:30,177 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:05:30,177 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-12-14 07:05:30,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:30,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:30,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:30,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:30,268 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:05:30,268 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-12-14 07:05:30,347 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 07:05:30,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 07:05:30,412 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:05:31,056 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '664#(and (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 1 |ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~dst~0#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 1 |ULTIMATE.start_cstrcpy_~dst~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.offset|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 07:05:31,056 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:05:31,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:05:31,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2022-12-14 07:05:31,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588704992] [2022-12-14 07:05:31,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:05:31,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 07:05:31,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:31,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 07:05:31,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1201, Unknown=2, NotChecked=0, Total=1332 [2022-12-14 07:05:31,059 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:32,084 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-12-14 07:05:32,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 07:05:32,085 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 07:05:32,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:32,085 INFO L225 Difference]: With dead ends: 20 [2022-12-14 07:05:32,085 INFO L226 Difference]: Without dead ends: 20 [2022-12-14 07:05:32,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=268, Invalid=1986, Unknown=2, NotChecked=0, Total=2256 [2022-12-14 07:05:32,087 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:32,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 6 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:05:32,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-12-14 07:05:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-12-14 07:05:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-12-14 07:05:32,089 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2022-12-14 07:05:32,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:32,090 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-12-14 07:05:32,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-12-14 07:05:32,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 07:05:32,090 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:32,090 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1] [2022-12-14 07:05:32,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 07:05:32,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 07:05:32,292 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:05:32,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:32,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2105849395, now seen corresponding path program 3 times [2022-12-14 07:05:32,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:32,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568001483] [2022-12-14 07:05:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:32,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:32,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:32,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568001483] [2022-12-14 07:05:32,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568001483] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:05:32,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196265654] [2022-12-14 07:05:32,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:05:32,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:32,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:05:32,770 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:05:32,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 07:05:32,845 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:05:32,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:05:32,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 94 conjunts are in the unsatisfiable core [2022-12-14 07:05:32,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:05:32,862 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:05:32,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 07:05:32,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:05:33,067 INFO L321 Elim1Store]: treesize reduction 34, result has 49.3 percent of original size [2022-12-14 07:05:33,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2022-12-14 07:05:33,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:33,337 INFO L321 Elim1Store]: treesize reduction 56, result has 49.1 percent of original size [2022-12-14 07:05:33,337 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 4 case distinctions, treesize of input 40 treesize of output 75 [2022-12-14 07:05:33,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:05:33,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2022-12-14 07:05:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:33,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:05:34,389 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 411 treesize of output 403 [2022-12-14 07:05:34,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 360 treesize of output 346 [2022-12-14 07:05:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:34,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196265654] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:05:34,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2145830837] [2022-12-14 07:05:34,749 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 07:05:34,750 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:05:34,750 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:05:34,750 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:05:34,750 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:05:34,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:34,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 07:05:34,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 07:05:34,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:05:34,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:34,874 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:05:34,874 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-12-14 07:05:34,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:34,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:34,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:34,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:34,959 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:05:34,959 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-12-14 07:05:35,029 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 07:05:35,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 07:05:35,097 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:05:35,848 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '868#(and (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 1 |ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~dst~0#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 1 |ULTIMATE.start_cstrcpy_~dst~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.offset|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 07:05:35,848 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:05:35,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:05:35,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 41 [2022-12-14 07:05:35,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806651157] [2022-12-14 07:05:35,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:05:35,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 07:05:35,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:35,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 07:05:35,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2068, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 07:05:35,850 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:05:38,855 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-12-14 07:05:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 07:05:38,855 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 07:05:38,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:05:38,856 INFO L225 Difference]: With dead ends: 28 [2022-12-14 07:05:38,856 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 07:05:38,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=439, Invalid=3721, Unknown=0, NotChecked=0, Total=4160 [2022-12-14 07:05:38,857 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:05:38,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 414 Invalid, 1 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 07:05:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 07:05:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-12-14 07:05:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-12-14 07:05:38,859 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 17 [2022-12-14 07:05:38,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:05:38,859 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-12-14 07:05:38,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-12-14 07:05:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 07:05:38,859 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:05:38,859 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1] [2022-12-14 07:05:38,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 07:05:39,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:39,061 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:05:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:05:39,062 INFO L85 PathProgramCache]: Analyzing trace with hash -30403389, now seen corresponding path program 4 times [2022-12-14 07:05:39,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:05:39,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110804754] [2022-12-14 07:05:39,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:05:39,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:05:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:39,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:05:39,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110804754] [2022-12-14 07:05:39,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110804754] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:05:39,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087504725] [2022-12-14 07:05:39,833 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:05:39,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:05:39,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:05:39,834 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:05:39,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 07:05:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:05:39,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 117 conjunts are in the unsatisfiable core [2022-12-14 07:05:39,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:05:39,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 07:05:39,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:05:40,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 07:05:40,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 07:05:40,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-12-14 07:05:40,915 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 49 treesize of output 43 [2022-12-14 07:05:41,193 INFO L321 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2022-12-14 07:05:41,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 47 [2022-12-14 07:05:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:41,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:05:43,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 07:05:43,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:05:43,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 72 [2022-12-14 07:05:43,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 103 [2022-12-14 07:05:43,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:05:43,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:05:43,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 80 [2022-12-14 07:05:43,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:05:43,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:05:43,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 07:05:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:05:43,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087504725] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:05:43,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [821339348] [2022-12-14 07:05:43,382 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 07:05:43,382 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:05:43,382 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:05:43,382 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:05:43,382 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:05:43,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:43,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 07:05:43,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 07:05:43,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:05:43,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:43,484 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:05:43,485 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-12-14 07:05:43,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:43,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:43,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:43,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:05:43,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:43,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:05:43,561 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:05:43,561 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-12-14 07:05:43,629 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 07:05:43,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 07:05:43,691 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:05:44,664 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1171#(and (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 1 |ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~dst~0#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 1 |ULTIMATE.start_cstrcpy_~dst~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.offset|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 07:05:44,664 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:05:44,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:05:44,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 23] total 64 [2022-12-14 07:05:44,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942340435] [2022-12-14 07:05:44,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:05:44,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-14 07:05:44,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:05:44,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-14 07:05:44,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=4609, Unknown=40, NotChecked=0, Total=4970 [2022-12-14 07:05:44,666 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 65 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:05:55,724 WARN L233 SmtUtils]: Spent 8.84s on a formula simplification. DAG size of input: 130 DAG size of output: 120 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:06:05,473 WARN L233 SmtUtils]: Spent 9.54s on a formula simplification. DAG size of input: 156 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:06:17,027 WARN L233 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 103 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:06:35,884 WARN L233 SmtUtils]: Spent 18.67s on a formula simplification. DAG size of input: 104 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:06:55,359 WARN L233 SmtUtils]: Spent 19.27s on a formula simplification. DAG size of input: 116 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:06:55,836 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) (.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse1 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse3 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (and (or .cse0 (and (<= 0 .cse1) (<= .cse2 .cse3)) (forall ((v_ArrVal_197 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_197) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0))) (or (forall ((v_ArrVal_197 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_197) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse1) 0)) .cse0 (and (<= (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse3) (<= 0 .cse2)) (forall ((v_ArrVal_196 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_196) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0))) (or .cse0 (and (<= 0 .cse4) (<= .cse1 .cse3))) (= 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (<= 6 .cse3) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= |c_ULTIMATE.start_main_~length2~0#1| (+ (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (* 18446744073709551616 (div |c_ULTIMATE.start_main_~length2~0#1| 18446744073709551616)))) (<= 1 |c_ULTIMATE.start_main_~length2~0#1|))) is different from false [2022-12-14 07:06:57,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:06:57,307 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-12-14 07:06:57,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 07:06:57,308 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 07:06:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:06:57,308 INFO L225 Difference]: With dead ends: 42 [2022-12-14 07:06:57,308 INFO L226 Difference]: Without dead ends: 42 [2022-12-14 07:06:57,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1838 ImplicationChecksByTransitivity, 75.6s TimeCoverageRelationStatistics Valid=851, Invalid=8789, Unknown=66, NotChecked=194, Total=9900 [2022-12-14 07:06:57,310 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 110 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 47 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:06:57,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 3 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 725 Invalid, 26 Unknown, 1 Unchecked, 1.2s Time] [2022-12-14 07:06:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-14 07:06:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-12-14 07:06:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:06:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-12-14 07:06:57,312 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 25 [2022-12-14 07:06:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:06:57,312 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-12-14 07:06:57,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:06:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-12-14 07:06:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 07:06:57,313 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:06:57,313 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1] [2022-12-14 07:06:57,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 07:06:57,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:06:57,515 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:06:57,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:06:57,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1260903965, now seen corresponding path program 5 times [2022-12-14 07:06:57,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:06:57,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070789755] [2022-12-14 07:06:57,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:06:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:06:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:06:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:06:59,383 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:06:59,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070789755] [2022-12-14 07:06:59,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070789755] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:06:59,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5359928] [2022-12-14 07:06:59,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:06:59,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:06:59,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:06:59,384 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:06:59,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 07:06:59,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-12-14 07:06:59,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:06:59,645 WARN L261 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 229 conjunts are in the unsatisfiable core [2022-12-14 07:06:59,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:06:59,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 07:06:59,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:06:59,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 07:07:00,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 07:07:00,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-12-14 07:07:00,988 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 49 treesize of output 43 [2022-12-14 07:07:01,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2022-12-14 07:07:02,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2022-12-14 07:07:02,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2022-12-14 07:07:03,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 67 [2022-12-14 07:07:03,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:03,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:03,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:03,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:03,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:04,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:04,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:04,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:04,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:04,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:04,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:04,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:04,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:04,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:07:04,056 INFO L321 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2022-12-14 07:07:04,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 85 treesize of output 81 [2022-12-14 07:07:04,062 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 07:07:04,073 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 07:07:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:07:04,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:08:07,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:08:07,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 120 [2022-12-14 07:08:07,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 195 [2022-12-14 07:08:07,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:08:07,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:08:07,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:08:07,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:08:07,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:08:07,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 148 [2022-12-14 07:08:07,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 07:08:07,848 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 07:08:07,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:08:07,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:08:07,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:08:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:08:08,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5359928] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:08:08,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1675814664] [2022-12-14 07:08:08,007 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 07:08:08,007 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:08:08,007 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:08:08,008 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:08:08,008 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:08:08,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:08:08,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 07:08:08,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 07:08:08,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:08:08,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:08:08,128 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:08:08,129 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-12-14 07:08:08,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:08:08,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:08:08,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:08:08,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:08:08,208 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:08:08,208 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-12-14 07:08:08,279 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 07:08:08,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 07:08:08,344 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:08:10,156 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1667#(and (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 1 |ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~dst~0#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 1 |ULTIMATE.start_cstrcpy_~dst~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.offset|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 07:08:10,157 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:08:10,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:08:10,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 39, 39] total 107 [2022-12-14 07:08:10,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689158220] [2022-12-14 07:08:10,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:08:10,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-12-14 07:08:10,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:08:10,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-12-14 07:08:10,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=767, Invalid=11826, Unknown=289, NotChecked=0, Total=12882 [2022-12-14 07:08:10,160 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 108 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 108 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:08:21,917 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|)) (.cse19 (div |c_ULTIMATE.start_main_~length2~0#1| 18446744073709551616))) (let ((.cse8 (<= (+ .cse19 1) 0)) (.cse7 (+ (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (* 18446744073709551616 .cse19))) (.cse16 (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse11 (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse10 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse2 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse0 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse12 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse5 (= (select .cse6 |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|) 0))) (and (or (<= .cse0 .cse1) (not (<= 0 .cse2)) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_256))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select .cse3 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse3 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) .cse5) (not (= (select .cse6 6) 0)) (or (<= .cse7 |c_ULTIMATE.start_main_~length2~0#1|) .cse8) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_254))) (or (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0) (= (select (select .cse9 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (<= .cse11 .cse1) .cse5 (not (<= 0 .cse0))) (= 0 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) (= (+ |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or (<= .cse12 .cse1) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_255))) (or (= (select (select (store .cse13 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0) (= (select (select .cse13 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse13 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0) (= (select (select (store .cse13 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)))) .cse5 (not (<= 0 .cse10))) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= 0 (select .cse6 (+ (- 1) |ULTIMATE.start_main_~length2~0#1|))) (<= |ULTIMATE.start_main_~length2~0#1| (select |c_#length| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|)))) (not (= (select .cse6 5) 0)) (= |c_ULTIMATE.start_cstrcpy_#t~post3#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_257))) (or (= (select (select .cse14 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (not (<= 0 .cse4)) (<= .cse10 .cse1) .cse5) (not (= (select .cse6 0) 0)) (or (not .cse8) (<= |c_ULTIMATE.start_main_~length2~0#1| .cse7)) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| 8) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_253))) (or (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0) (= (select (select .cse15 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse12) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (<= .cse16 .cse1) .cse5 (not (<= 0 .cse12))) (not (= (select .cse6 (+ (- 1) |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|)) 0)) (not (= 0 (select .cse6 1))) (or (not (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (<= .cse2 .cse1) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) .cse5) (not (= 0 (select .cse6 4))) (not (= (select .cse6 2) 0)) (not (= (select .cse6 3) 0)) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_251))) (or (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse12) 0) (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0) (= (select (select .cse17 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= 0 (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4)) (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse11) 0) (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse16) 0)))) (<= (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1) (not (<= 0 .cse16)) .cse5) (or (not (<= 0 .cse11)) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_252))) (or (= (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse11) 0) (= (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0) (= (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0) (= (select (select .cse18 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse12) 0)))) (<= (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1) .cse5)))) is different from true [2022-12-14 07:11:27,837 WARN L233 SmtUtils]: Spent 2.52m on a formula simplification. DAG size of input: 233 DAG size of output: 217 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:11:29,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:11:30,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:11:32,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:11:35,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:11:37,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:11:38,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:11:40,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:11:47,554 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (let ((.cse15 (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse11 (<= .cse4 .cse1)) (.cse12 (select |c_#length| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|)) (.cse8 (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse7 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse2 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse0 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse9 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse5 (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|) |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|) 0))) (and (or (<= .cse0 .cse1) (not (<= 0 .cse2)) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_256))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select .cse3 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse3 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) .cse5) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_254))) (or (= (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select .cse6 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (<= .cse8 .cse1) .cse5 (not (<= 0 .cse0))) (or (<= .cse9 .cse1) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_255))) (or (= (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select .cse10 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0) (= (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)))) .cse5 (not (<= 0 .cse7))) (or .cse11 .cse5 (<= .cse12 |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|)) (= |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| 9) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_257))) (or (= (select (select .cse13 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse13 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (not (<= 0 .cse4)) (<= .cse7 .cse1) .cse5) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_253))) (or (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select .cse14 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse9) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (<= (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1) .cse5 (not (<= 0 .cse9))) (or (not .cse15) (<= .cse2 .cse1) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) .cse5) (<= 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or (not (<= 0 |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|)) (and .cse15 .cse11) .cse5) (<= 10 .cse12) (or (not (<= 0 .cse8)) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_252))) (or (= (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse8) 0) (= (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0) (= (select (select .cse16 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse9) 0)))) (<= (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1) .cse5)))) is different from false [2022-12-14 07:13:56,736 WARN L233 SmtUtils]: Spent 1.70m on a formula simplification. DAG size of input: 191 DAG size of output: 177 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:14:00,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:14:07,826 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) (.cse5 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse3 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse7 (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse4 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse2 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) (and (or (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) .cse1 (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (<= .cse3 .cse4) (not (<= 0 .cse0))) (or .cse1 (not (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (<= .cse0 .cse4)) (or (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) .cse1 (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) (<= .cse6 .cse4) (forall ((v_ArrVal_256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (not (<= 0 .cse5))) (or (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) .cse1 (forall ((v_ArrVal_255 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) (<= (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse4) (not (<= 0 .cse6))) (or .cse1 (<= .cse7 .cse4) (forall ((v_ArrVal_256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_255 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse3) 0)) (not (<= 0 .cse3))) (<= .cse2 .cse4) (<= 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or .cse1 (not (<= 0 .cse2)) (<= .cse5 .cse4) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0))) (or (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) .cse1 (forall ((v_ArrVal_255 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) (not (<= 0 .cse7)) (forall ((v_ArrVal_256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0)) (<= (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse4) (forall ((v_ArrVal_254 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_253 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0))))) is different from false [2022-12-14 07:14:07,905 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse0 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse8 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse2 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse12 (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse5 (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|) |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|) 0))) (and (or (<= .cse0 .cse1) (not (<= 0 .cse2)) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_256))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select .cse3 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse3 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) .cse5) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_254))) (or (= (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select .cse6 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (<= (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1) .cse5 (not (<= 0 .cse0))) (or (<= .cse8 .cse1) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_255))) (or (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select .cse9 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)))) .cse5 (not (<= 0 .cse7))) (<= (+ |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1) (select |c_#length| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|)) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_257))) (or (= (select (select .cse10 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (not (<= 0 .cse4)) (<= .cse7 .cse1) .cse5) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_253))) (or (= (select (select (store .cse11 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select .cse11 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse11 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse11 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse8) 0) (= (select (select (store .cse11 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse11 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (<= (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1) .cse5 (not (<= 0 .cse8))) (or (not .cse12) (<= .cse2 .cse1) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) .cse5) (<= 9 |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|) (or (not (<= 0 |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|)) (and .cse12 (<= .cse4 .cse1)) .cse5))) is different from false [2022-12-14 07:14:49,997 WARN L233 SmtUtils]: Spent 33.40s on a formula simplification. DAG size of input: 153 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:14:52,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 07:15:00,130 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse5 (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse3 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) (.cse6 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse4 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse2 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) (and (or (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) .cse1 (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (<= .cse3 .cse4) (not (<= 0 .cse0))) (or .cse1 (not .cse5) (<= .cse0 .cse4)) (or (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) .cse1 (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (<= .cse7 .cse4) (forall ((v_ArrVal_256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (not (<= 0 .cse6))) (or (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) .cse1 (forall ((v_ArrVal_255 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (<= (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse4) (not (<= 0 .cse7))) .cse5 (or .cse1 (<= (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse4) (forall ((v_ArrVal_256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_255 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse3) 0)) (not (<= 0 .cse3))) (<= .cse2 .cse4) (or .cse1 (not (<= 0 .cse2)) (<= .cse6 .cse4) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0))))) is different from false [2022-12-14 07:15:12,344 WARN L233 SmtUtils]: Spent 9.66s on a formula simplification. DAG size of input: 140 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:15:23,308 WARN L233 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 84 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:15:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:15:31,542 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-12-14 07:15:31,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-12-14 07:15:31,542 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 108 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-12-14 07:15:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:15:31,543 INFO L225 Difference]: With dead ends: 78 [2022-12-14 07:15:31,543 INFO L226 Difference]: Without dead ends: 78 [2022-12-14 07:15:31,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 5024 ImplicationChecksByTransitivity, 483.1s TimeCoverageRelationStatistics Valid=2238, Invalid=25722, Unknown=452, NotChecked=1690, Total=30102 [2022-12-14 07:15:31,549 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 175 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 147 mSolverCounterUnsat, 81 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 2481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 81 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:15:31,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 3 Invalid, 2481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2248 Invalid, 81 Unknown, 5 Unchecked, 27.2s Time] [2022-12-14 07:15:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-14 07:15:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-12-14 07:15:31,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:15:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2022-12-14 07:15:31,554 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 41 [2022-12-14 07:15:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:15:31,555 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2022-12-14 07:15:31,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 108 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:15:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-12-14 07:15:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-14 07:15:31,556 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:15:31,556 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1] [2022-12-14 07:15:31,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 07:15:31,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 07:15:31,758 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 07:15:31,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:15:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 233809259, now seen corresponding path program 6 times [2022-12-14 07:15:31,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:15:31,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606302451] [2022-12-14 07:15:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:15:31,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:15:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:15:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:15:36,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:15:36,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606302451] [2022-12-14 07:15:36,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606302451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:15:36,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803214522] [2022-12-14 07:15:36,915 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:15:36,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:15:36,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:15:36,916 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:15:36,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d505119-3069-49ba-aa80-8a91eb5c8500/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 07:15:38,891 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:15:38,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:15:38,900 WARN L261 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 391 conjunts are in the unsatisfiable core [2022-12-14 07:15:38,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:15:38,919 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:15:38,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 07:15:38,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 07:15:39,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:15:39,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 07:15:39,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 07:15:40,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-12-14 07:15:40,984 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 49 treesize of output 43 [2022-12-14 07:15:41,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 55 treesize of output 47 [2022-12-14 07:15:42,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2022-12-14 07:15:43,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2022-12-14 07:15:44,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 67 [2022-12-14 07:15:45,451 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 91 treesize of output 75 [2022-12-14 07:15:46,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 77 [2022-12-14 07:15:47,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 83 [2022-12-14 07:15:48,844 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 113 treesize of output 91 [2022-12-14 07:15:50,219 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 121 treesize of output 97 [2022-12-14 07:15:51,574 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 131 treesize of output 105 [2022-12-14 07:15:53,116 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 141 treesize of output 113 [2022-12-14 07:15:54,896 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 143 treesize of output 113 [2022-12-14 07:15:56,677 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 151 treesize of output 119 [2022-12-14 07:15:58,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:15:58,201 INFO L321 Elim1Store]: treesize reduction 68, result has 53.1 percent of original size [2022-12-14 07:15:58,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 153 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 18 case distinctions, treesize of input 155 treesize of output 151 [2022-12-14 07:15:58,208 WARN L718 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2022-12-14 07:16:09,516 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-12-14 07:16:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:16:14,455 INFO L328 TraceCheckSpWp]: Computing backward predicates...