./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-15/cstrcpy_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-15/cstrcpy_malloc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b3793c1153138718c278bf2758234e75646fb19e62e98d110099399474912470 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 14:45:32,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:45:32,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:45:32,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:45:32,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:45:32,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:45:32,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:45:32,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:45:32,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:45:32,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:45:32,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:45:32,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:45:32,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:45:32,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:45:32,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:45:32,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:45:32,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:45:32,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:45:32,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:45:32,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:45:32,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:45:32,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:45:32,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:45:32,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:45:32,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:45:32,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:45:32,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:45:32,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:45:32,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:45:32,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:45:32,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:45:32,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:45:32,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:45:32,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:45:32,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:45:32,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:45:32,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:45:32,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:45:32,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:45:32,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:45:32,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:45:32,402 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-11-23 14:45:32,441 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:45:32,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:45:32,442 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:45:32,443 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:45:32,444 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:45:32,444 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:45:32,444 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:45:32,444 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:45:32,445 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:45:32,445 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:45:32,446 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:45:32,446 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:45:32,447 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:45:32,447 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:45:32,447 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:45:32,448 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:45:32,448 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:45:32,448 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:45:32,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:45:32,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:45:32,449 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:45:32,450 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:45:32,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:45:32,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:45:32,451 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:45:32,451 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:45:32,452 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:45:32,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:45:32,452 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:45:32,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:45:32,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:45:32,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:45:32,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:45:32,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:45:32,454 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:45:32,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:45:32,455 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:45:32,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:45:32,455 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:45:32,456 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_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/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_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3793c1153138718c278bf2758234e75646fb19e62e98d110099399474912470 [2022-11-23 14:45:32,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:45:32,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:45:32,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:45:32,776 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:45:32,777 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:45:32,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/termination-15/cstrcpy_malloc.i [2022-11-23 14:45:36,125 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:45:36,521 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:45:36,522 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/sv-benchmarks/c/termination-15/cstrcpy_malloc.i [2022-11-23 14:45:36,533 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/data/6f9513150/d6db41ef39254f27ace8ec59a38a4545/FLAGd843007bf [2022-11-23 14:45:36,551 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/data/6f9513150/d6db41ef39254f27ace8ec59a38a4545 [2022-11-23 14:45:36,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:45:36,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:45:36,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:45:36,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:45:36,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:45:36,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:45:36" (1/1) ... [2022-11-23 14:45:36,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bcacd53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:36, skipping insertion in model container [2022-11-23 14:45:36,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:45:36" (1/1) ... [2022-11-23 14:45:36,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:45:36,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:45:37,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:45:37,131 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:45:37,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:45:37,243 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:45:37,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:37 WrapperNode [2022-11-23 14:45:37,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:45:37,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:45:37,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:45:37,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:45:37,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:37" (1/1) ... [2022-11-23 14:45:37,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:37" (1/1) ... [2022-11-23 14:45:37,291 INFO L138 Inliner]: procedures = 152, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-11-23 14:45:37,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:45:37,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:45:37,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:45:37,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:45:37,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:37" (1/1) ... [2022-11-23 14:45:37,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:37" (1/1) ... [2022-11-23 14:45:37,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:37" (1/1) ... [2022-11-23 14:45:37,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:37" (1/1) ... [2022-11-23 14:45:37,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:37" (1/1) ... [2022-11-23 14:45:37,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:37" (1/1) ... [2022-11-23 14:45:37,336 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:37" (1/1) ... [2022-11-23 14:45:37,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:37" (1/1) ... [2022-11-23 14:45:37,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:45:37,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:45:37,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:45:37,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:45:37,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:37" (1/1) ... [2022-11-23 14:45:37,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:45:37,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:45:37,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:45:37,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:45:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 14:45:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 14:45:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 14:45:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:45:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:45:37,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:45:37,529 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:45:37,532 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:45:37,806 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:45:37,859 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:45:37,860 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 14:45:37,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:45:37 BoogieIcfgContainer [2022-11-23 14:45:37,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:45:37,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:45:37,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:45:37,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:45:37,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:45:36" (1/3) ... [2022-11-23 14:45:37,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2e53c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:45:37, skipping insertion in model container [2022-11-23 14:45:37,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:37" (2/3) ... [2022-11-23 14:45:37,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2e53c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:45:37, skipping insertion in model container [2022-11-23 14:45:37,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:45:37" (3/3) ... [2022-11-23 14:45:37,874 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy_malloc.i [2022-11-23 14:45:37,914 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:45:37,926 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-11-23 14:45:37,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:45:38,007 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;@2463f488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:45:38,007 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-23 14:45:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 15 states have (on average 2.066666666666667) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:45:38,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:38,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:45:38,021 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:38,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:38,032 INFO L85 PathProgramCache]: Analyzing trace with hash 96686, now seen corresponding path program 1 times [2022-11-23 14:45:38,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:38,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224166382] [2022-11-23 14:45:38,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:38,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:38,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:38,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224166382] [2022-11-23 14:45:38,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224166382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:45:38,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:45:38,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:45:38,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444828316] [2022-11-23 14:45:38,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:45:38,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:45:38,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:38,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:45:38,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:45:38,298 INFO L87 Difference]: Start difference. First operand has 29 states, 15 states have (on average 2.066666666666667) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:38,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:38,372 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-11-23 14:45:38,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:45:38,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 14:45:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:38,387 INFO L225 Difference]: With dead ends: 30 [2022-11-23 14:45:38,387 INFO L226 Difference]: Without dead ends: 28 [2022-11-23 14:45:38,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:45:38,398 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:38,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:45:38,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-23 14:45:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-23 14:45:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-11-23 14:45:38,443 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 3 [2022-11-23 14:45:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:38,444 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-11-23 14:45:38,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:38,446 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-11-23 14:45:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:45:38,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:38,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:45:38,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:45:38,450 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:38,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:38,451 INFO L85 PathProgramCache]: Analyzing trace with hash 96710, now seen corresponding path program 1 times [2022-11-23 14:45:38,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:38,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560445033] [2022-11-23 14:45:38,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:38,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:38,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:38,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560445033] [2022-11-23 14:45:38,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560445033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:45:38,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:45:38,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:45:38,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672299479] [2022-11-23 14:45:38,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:45:38,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:45:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:38,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:45:38,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:45:38,654 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:38,688 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-11-23 14:45:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:45:38,688 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-11-23 14:45:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:38,689 INFO L225 Difference]: With dead ends: 27 [2022-11-23 14:45:38,690 INFO L226 Difference]: Without dead ends: 27 [2022-11-23 14:45:38,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:45:38,691 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:38,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:45:38,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-23 14:45:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-23 14:45:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.8) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-11-23 14:45:38,697 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 3 [2022-11-23 14:45:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:38,698 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-11-23 14:45:38,698 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-11-23 14:45:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-11-23 14:45:38,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:45:38,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:38,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:45:38,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 14:45:38,700 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:38,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash 96711, now seen corresponding path program 1 times [2022-11-23 14:45:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:38,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963118339] [2022-11-23 14:45:38,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:38,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:38,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:38,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963118339] [2022-11-23 14:45:38,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963118339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:45:38,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:45:38,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:45:38,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579439536] [2022-11-23 14:45:38,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:45:38,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:45:38,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:38,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:45:38,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:45:38,967 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:39,006 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-11-23 14:45:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:45:39,007 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-11-23 14:45:39,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:39,008 INFO L225 Difference]: With dead ends: 25 [2022-11-23 14:45:39,008 INFO L226 Difference]: Without dead ends: 25 [2022-11-23 14:45:39,008 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-11-23 14:45:39,010 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:39,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 12 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:45:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-23 14:45:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-23 14:45:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-11-23 14:45:39,016 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 3 [2022-11-23 14:45:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:39,016 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-11-23 14:45:39,016 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-11-23 14:45:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-11-23 14:45:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 14:45:39,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:39,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 14:45:39,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:45:39,018 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:39,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:39,019 INFO L85 PathProgramCache]: Analyzing trace with hash 92978609, now seen corresponding path program 1 times [2022-11-23 14:45:39,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:39,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429330602] [2022-11-23 14:45:39,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:39,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:39,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429330602] [2022-11-23 14:45:39,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429330602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:45:39,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:45:39,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:45:39,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254396162] [2022-11-23 14:45:39,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:45:39,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:45:39,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:39,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:45:39,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:45:39,148 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:39,224 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-11-23 14:45:39,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:45:39,225 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-11-23 14:45:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:39,228 INFO L225 Difference]: With dead ends: 24 [2022-11-23 14:45:39,228 INFO L226 Difference]: Without dead ends: 24 [2022-11-23 14:45:39,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:45:39,230 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:39,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:45:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-23 14:45:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-23 14:45:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-11-23 14:45:39,248 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 5 [2022-11-23 14:45:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:39,250 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-11-23 14:45:39,250 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-11-23 14:45:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-11-23 14:45:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 14:45:39,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:39,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 14:45:39,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 14:45:39,252 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:39,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:39,253 INFO L85 PathProgramCache]: Analyzing trace with hash 92978610, now seen corresponding path program 1 times [2022-11-23 14:45:39,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:39,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475092500] [2022-11-23 14:45:39,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:39,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:39,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:39,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475092500] [2022-11-23 14:45:39,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475092500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:45:39,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:45:39,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:45:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187812725] [2022-11-23 14:45:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:45:39,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:45:39,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:39,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:45:39,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:45:39,569 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:39,670 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-11-23 14:45:39,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:45:39,671 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-11-23 14:45:39,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:39,672 INFO L225 Difference]: With dead ends: 30 [2022-11-23 14:45:39,672 INFO L226 Difference]: Without dead ends: 30 [2022-11-23 14:45:39,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:45:39,674 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:39,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 29 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:45:39,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-23 14:45:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-11-23 14:45:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-11-23 14:45:39,680 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 5 [2022-11-23 14:45:39,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:39,681 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-11-23 14:45:39,682 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-11-23 14:45:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-11-23 14:45:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:45:39,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:39,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:45:39,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 14:45:39,683 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:39,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:39,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1412630415, now seen corresponding path program 1 times [2022-11-23 14:45:39,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:39,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370904367] [2022-11-23 14:45:39,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:39,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:39,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:39,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370904367] [2022-11-23 14:45:39,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370904367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:45:39,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:45:39,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:45:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923538369] [2022-11-23 14:45:39,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:45:39,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:45:39,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:39,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:45:39,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:45:39,861 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:39,935 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-11-23 14:45:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:45:39,936 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-11-23 14:45:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:39,936 INFO L225 Difference]: With dead ends: 25 [2022-11-23 14:45:39,937 INFO L226 Difference]: Without dead ends: 25 [2022-11-23 14:45:39,937 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-11-23 14:45:39,939 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:39,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 21 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:45:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-23 14:45:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-23 14:45:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-11-23 14:45:39,943 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 6 [2022-11-23 14:45:39,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:39,944 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-11-23 14:45:39,944 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-11-23 14:45:39,945 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-11-23 14:45:39,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:45:39,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:39,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:45:39,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 14:45:39,946 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:39,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:39,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1412630414, now seen corresponding path program 1 times [2022-11-23 14:45:39,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:39,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119817496] [2022-11-23 14:45:39,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:39,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:40,206 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:40,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119817496] [2022-11-23 14:45:40,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119817496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:45:40,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:45:40,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:45:40,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338063985] [2022-11-23 14:45:40,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:45:40,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:45:40,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:40,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:45:40,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:45:40,209 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:40,398 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-11-23 14:45:40,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:45:40,399 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-11-23 14:45:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:40,402 INFO L225 Difference]: With dead ends: 26 [2022-11-23 14:45:40,402 INFO L226 Difference]: Without dead ends: 26 [2022-11-23 14:45:40,404 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-11-23 14:45:40,408 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:40,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 7 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:45:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-23 14:45:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-11-23 14:45:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-11-23 14:45:40,421 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 6 [2022-11-23 14:45:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:40,421 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-11-23 14:45:40,422 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-11-23 14:45:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-11-23 14:45:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 14:45:40,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:40,422 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:45:40,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 14:45:40,423 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:40,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1583118470, now seen corresponding path program 1 times [2022-11-23 14:45:40,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:40,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038914617] [2022-11-23 14:45:40,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:40,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:40,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038914617] [2022-11-23 14:45:40,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038914617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:45:40,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667736599] [2022-11-23 14:45:40,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:40,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:45:40,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:45:40,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:45:40,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:45:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:41,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 14:45:41,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:45:41,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-23 14:45:41,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:45:41,424 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-11-23 14:45:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:41,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:45:41,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-11-23 14:45:41,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 16 treesize of output 12 [2022-11-23 14:45:41,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-23 14:45:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:41,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667736599] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:45:41,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [629913679] [2022-11-23 14:45:41,910 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-23 14:45:41,910 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:45:41,914 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:45:41,920 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:45:41,921 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:45:41,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:45:41,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-23 14:45:42,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-23 14:45:42,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:45:42,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:45:42,193 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 14:45:42,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-23 14:45:42,392 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:45:42,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:45:42,467 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:45:42,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:45:42,480 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:45:43,380 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '512#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-11-23 14:45:43,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:45:43,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:45:43,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-11-23 14:45:43,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104238203] [2022-11-23 14:45:43,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:45:43,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 14:45:43,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:43,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 14:45:43,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2022-11-23 14:45:43,383 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:43,924 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-11-23 14:45:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 14:45:43,925 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-11-23 14:45:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:43,925 INFO L225 Difference]: With dead ends: 31 [2022-11-23 14:45:43,926 INFO L226 Difference]: Without dead ends: 31 [2022-11-23 14:45:43,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 14:45:43,927 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 47 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:43,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 68 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:45:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-23 14:45:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-11-23 14:45:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-11-23 14:45:43,934 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 9 [2022-11-23 14:45:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:43,934 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-11-23 14:45:43,934 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-11-23 14:45:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-11-23 14:45:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 14:45:43,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:43,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:45:43,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 14:45:44,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:45:44,136 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:44,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:44,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1832057717, now seen corresponding path program 1 times [2022-11-23 14:45:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:44,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173822178] [2022-11-23 14:45:44,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:44,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:44,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173822178] [2022-11-23 14:45:44,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173822178] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:45:44,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:45:44,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:45:44,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117045298] [2022-11-23 14:45:44,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:45:44,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:45:44,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:44,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:45:44,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:45:44,171 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:44,187 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-11-23 14:45:44,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:45:44,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 14:45:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:44,190 INFO L225 Difference]: With dead ends: 27 [2022-11-23 14:45:44,190 INFO L226 Difference]: Without dead ends: 27 [2022-11-23 14:45:44,191 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-11-23 14:45:44,193 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:44,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 13 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:45:44,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-23 14:45:44,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-23 14:45:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-11-23 14:45:44,205 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 10 [2022-11-23 14:45:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:44,205 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-11-23 14:45:44,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-11-23 14:45:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 14:45:44,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:44,206 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-11-23 14:45:44,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 14:45:44,207 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:44,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:44,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1832032342, now seen corresponding path program 1 times [2022-11-23 14:45:44,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:44,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396829354] [2022-11-23 14:45:44,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:44,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:45,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:45,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396829354] [2022-11-23 14:45:45,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396829354] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:45:45,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354237847] [2022-11-23 14:45:45,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:45,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:45:45,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:45:45,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:45:45,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 14:45:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:45,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-23 14:45:45,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:45:45,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-23 14:45:45,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-23 14:45:45,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:45:45,432 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:45:45,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2022-11-23 14:45:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:45,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:45:46,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-11-23 14:45:46,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-23 14:45:46,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:45:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:46,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354237847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:45:46,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [601606308] [2022-11-23 14:45:46,225 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-23 14:45:46,225 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:45:46,226 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:45:46,226 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:45:46,226 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:45:46,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:45:46,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-23 14:45:46,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-23 14:45:46,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:45:46,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:45:46,433 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 14:45:46,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-23 14:45:46,538 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:45:46,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:45:46,614 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:45:46,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:45:46,626 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:45:47,742 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '729#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (= (select |#valid| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (= (select (select |#memory_int| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) |ULTIMATE.start_cstrcpy_#t~mem207#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-11-23 14:45:47,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:45:47,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:45:47,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-23 14:45:47,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546280023] [2022-11-23 14:45:47,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:45:47,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 14:45:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:47,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 14:45:47,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 14:45:47,745 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:49,755 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-11-23 14:45:49,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 14:45:49,756 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-11-23 14:45:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:49,756 INFO L225 Difference]: With dead ends: 28 [2022-11-23 14:45:49,757 INFO L226 Difference]: Without dead ends: 28 [2022-11-23 14:45:49,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=251, Invalid=1471, Unknown=0, NotChecked=0, Total=1722 [2022-11-23 14:45:49,758 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 117 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:49,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 23 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:45:49,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-23 14:45:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-11-23 14:45:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-11-23 14:45:49,762 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2022-11-23 14:45:49,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:49,762 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-11-23 14:45:49,763 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-11-23 14:45:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-11-23 14:45:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:45:49,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:49,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:45:49,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:45:49,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:45:49,970 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:49,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:49,970 INFO L85 PathProgramCache]: Analyzing trace with hash -959214298, now seen corresponding path program 1 times [2022-11-23 14:45:49,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:49,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387385094] [2022-11-23 14:45:49,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:49,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:50,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:50,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387385094] [2022-11-23 14:45:50,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387385094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:45:50,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:45:50,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:45:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032765256] [2022-11-23 14:45:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:45:50,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:45:50,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:50,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:45:50,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:45:50,023 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:50,056 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-11-23 14:45:50,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:45:50,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 14:45:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:50,057 INFO L225 Difference]: With dead ends: 25 [2022-11-23 14:45:50,057 INFO L226 Difference]: Without dead ends: 25 [2022-11-23 14:45:50,058 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-11-23 14:45:50,058 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:50,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 21 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:45:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-23 14:45:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-23 14:45:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-11-23 14:45:50,061 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 11 [2022-11-23 14:45:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:50,061 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-11-23 14:45:50,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-11-23 14:45:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:45:50,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:50,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:45:50,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 14:45:50,093 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:50,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:50,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1613030920, now seen corresponding path program 1 times [2022-11-23 14:45:50,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:50,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570231774] [2022-11-23 14:45:50,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:50,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:50,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:50,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570231774] [2022-11-23 14:45:50,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570231774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:45:50,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:45:50,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:45:50,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092564954] [2022-11-23 14:45:50,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:45:50,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:45:50,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:45:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:45:50,139 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:50,151 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-11-23 14:45:50,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:45:50,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 14:45:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:50,152 INFO L225 Difference]: With dead ends: 24 [2022-11-23 14:45:50,153 INFO L226 Difference]: Without dead ends: 24 [2022-11-23 14:45:50,153 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-11-23 14:45:50,154 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:50,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:45:50,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-23 14:45:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-23 14:45:50,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-11-23 14:45:50,157 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 13 [2022-11-23 14:45:50,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:50,157 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-11-23 14:45:50,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-11-23 14:45:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:45:50,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:50,158 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2022-11-23 14:45:50,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 14:45:50,159 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:50,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:50,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1926091454, now seen corresponding path program 2 times [2022-11-23 14:45:50,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:50,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169193459] [2022-11-23 14:45:50,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:50,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:51,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:51,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169193459] [2022-11-23 14:45:51,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169193459] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:45:51,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606245396] [2022-11-23 14:45:51,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:45:51,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:45:51,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:45:51,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:45:51,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 14:45:51,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 14:45:51,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:45:51,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-23 14:45:51,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:45:51,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-23 14:45:51,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-23 14:45:51,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-11-23 14:45:51,838 INFO L321 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2022-11-23 14:45:51,838 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 30 treesize of output 28 [2022-11-23 14:45:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:52,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:45:52,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:45:52,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2022-11-23 14:45:52,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-23 14:45:52,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2022-11-23 14:45:52,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-23 14:45:52,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:45:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:52,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606245396] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:45:52,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [456610635] [2022-11-23 14:45:52,851 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-23 14:45:52,851 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:45:52,851 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:45:52,851 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:45:52,851 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:45:52,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:45:52,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-23 14:45:52,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-23 14:45:53,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:45:53,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:45:53,022 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 14:45:53,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-23 14:45:53,135 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:45:53,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:45:53,223 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:45:53,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:45:53,245 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:45:54,832 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1021#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-11-23 14:45:54,832 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:45:54,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:45:54,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2022-11-23 14:45:54,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569767634] [2022-11-23 14:45:54,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:45:54,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 14:45:54,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:54,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 14:45:54,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1273, Unknown=3, NotChecked=0, Total=1406 [2022-11-23 14:45:54,835 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:56,559 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-11-23 14:45:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 14:45:56,560 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-11-23 14:45:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:56,560 INFO L225 Difference]: With dead ends: 40 [2022-11-23 14:45:56,560 INFO L226 Difference]: Without dead ends: 40 [2022-11-23 14:45:56,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=279, Invalid=2168, Unknown=3, NotChecked=0, Total=2450 [2022-11-23 14:45:56,562 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 104 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:56,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 51 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 14:45:56,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-23 14:45:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-11-23 14:45:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-11-23 14:45:56,565 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 13 [2022-11-23 14:45:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:56,565 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-11-23 14:45:56,565 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-11-23 14:45:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-11-23 14:45:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 14:45:56,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:56,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:45:56,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:45:56,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 14:45:56,778 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:56,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1535648945, now seen corresponding path program 1 times [2022-11-23 14:45:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:56,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873562669] [2022-11-23 14:45:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:56,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:56,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:56,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873562669] [2022-11-23 14:45:56,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873562669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:45:56,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:45:56,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:45:56,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764255624] [2022-11-23 14:45:56,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:45:56,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:45:56,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:56,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:45:56,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:45:56,887 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-11-23 14:45:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:56,913 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-11-23 14:45:56,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:45:56,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 14:45:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:56,914 INFO L225 Difference]: With dead ends: 27 [2022-11-23 14:45:56,915 INFO L226 Difference]: Without dead ends: 27 [2022-11-23 14:45:56,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:45:56,916 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:56,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 8 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:45:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-23 14:45:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-23 14:45:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-11-23 14:45:56,927 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 14 [2022-11-23 14:45:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:56,927 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-11-23 14:45:56,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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-11-23 14:45:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-11-23 14:45:56,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 14:45:56,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:56,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:45:56,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 14:45:56,929 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:56,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:56,929 INFO L85 PathProgramCache]: Analyzing trace with hash -360476949, now seen corresponding path program 1 times [2022-11-23 14:45:56,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:56,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486435008] [2022-11-23 14:45:56,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:56,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:57,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:57,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486435008] [2022-11-23 14:45:57,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486435008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:45:57,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:45:57,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:45:57,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74959037] [2022-11-23 14:45:57,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:45:57,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:45:57,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:45:57,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:45:57,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:45:57,192 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:45:57,304 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-11-23 14:45:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:45:57,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-23 14:45:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:45:57,305 INFO L225 Difference]: With dead ends: 26 [2022-11-23 14:45:57,305 INFO L226 Difference]: Without dead ends: 18 [2022-11-23 14:45:57,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:45:57,306 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:45:57,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 17 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:45:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-23 14:45:57,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-23 14:45:57,312 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-11-23 14:45:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-11-23 14:45:57,312 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2022-11-23 14:45:57,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:45:57,313 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-11-23 14:45:57,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:45:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-11-23 14:45:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 14:45:57,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:45:57,314 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1] [2022-11-23 14:45:57,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 14:45:57,314 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:45:57,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:45:57,315 INFO L85 PathProgramCache]: Analyzing trace with hash 568897290, now seen corresponding path program 3 times [2022-11-23 14:45:57,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:45:57,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753730467] [2022-11-23 14:45:57,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:45:57,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:45:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:45:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:58,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:45:58,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753730467] [2022-11-23 14:45:58,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753730467] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:45:58,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130657093] [2022-11-23 14:45:58,231 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:45:58,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:45:58,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:45:58,233 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:45:58,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 14:45:58,364 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:45:58,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:45:58,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-23 14:45:58,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:45:58,389 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 14:45:58,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-23 14:45:58,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-23 14:45:58,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-23 14:45:58,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-11-23 14:45:59,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-23 14:45:59,454 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-23 14:45:59,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2022-11-23 14:45:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:45:59,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:46:01,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:46:01,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 48 [2022-11-23 14:46:01,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2022-11-23 14:46:01,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2022-11-23 14:46:01,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:46:01,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:46:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:46:01,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130657093] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:46:01,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [339885471] [2022-11-23 14:46:01,294 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-23 14:46:01,294 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:46:01,295 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:46:01,295 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:46:01,295 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:46:01,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:01,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-23 14:46:01,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-23 14:46:01,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:01,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:01,457 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 14:46:01,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-23 14:46:01,537 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:46:01,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:46:01,591 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:46:01,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:46:01,599 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:46:02,819 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1370#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-11-23 14:46:02,819 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:46:02,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:46:02,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 41 [2022-11-23 14:46:02,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647040340] [2022-11-23 14:46:02,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:46:02,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-23 14:46:02,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:02,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-23 14:46:02,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2168, Unknown=9, NotChecked=0, Total=2352 [2022-11-23 14:46:02,822 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-11-23 14:46:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:46:12,787 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-11-23 14:46:12,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 14:46:12,788 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-11-23 14:46:12,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:46:12,788 INFO L225 Difference]: With dead ends: 28 [2022-11-23 14:46:12,788 INFO L226 Difference]: Without dead ends: 28 [2022-11-23 14:46:12,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=420, Invalid=3855, Unknown=15, NotChecked=0, Total=4290 [2022-11-23 14:46:12,791 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 81 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 43 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:46:12,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 2 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 421 Invalid, 6 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 14:46:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-23 14:46:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-11-23 14:46:12,793 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-11-23 14:46:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-11-23 14:46:12,793 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 17 [2022-11-23 14:46:12,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:46:12,793 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-11-23 14:46:12,794 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-11-23 14:46:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-11-23 14:46:12,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 14:46:12,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:46:12,794 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1] [2022-11-23 14:46:12,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:46:12,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 14:46:12,995 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:46:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:46:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1620395674, now seen corresponding path program 4 times [2022-11-23 14:46:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:46:12,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960666514] [2022-11-23 14:46:12,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:46:12,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:46:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:46:14,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:46:14,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960666514] [2022-11-23 14:46:14,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960666514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:46:14,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528142296] [2022-11-23 14:46:14,573 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 14:46:14,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:46:14,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:46:14,577 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:46:14,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 14:46:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:46:14,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-23 14:46:14,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:46:14,741 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 14:46:14,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-23 14:46:14,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-23 14:46:14,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:46:15,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-23 14:46:15,493 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-11-23 14:46:15,934 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-11-23 14:46:16,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-11-23 14:46:16,897 INFO L321 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2022-11-23 14:46:16,897 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-11-23 14:46:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:46:17,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:46:17,846 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_234 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_234) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) (and (<= 0 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (<= (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post206#1.base|) |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset|) 0)) is different from false [2022-11-23 14:46:20,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:46:20,275 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-11-23 14:46:20,281 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-11-23 14:46:20,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:20,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:20,322 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-11-23 14:46:20,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:20,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:46:20,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-23 14:46:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-23 14:46:20,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528142296] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:46:20,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [726454735] [2022-11-23 14:46:20,579 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-23 14:46:20,579 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:46:20,580 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:46:20,580 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:46:20,580 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:46:20,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:20,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-23 14:46:20,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-23 14:46:20,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:46:20,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:46:20,747 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 14:46:20,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-23 14:46:20,836 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:46:20,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:46:20,894 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:46:20,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:46:20,903 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:46:22,449 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1674#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-11-23 14:46:22,449 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:46:22,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:46:22,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 23] total 64 [2022-11-23 14:46:22,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579395244] [2022-11-23 14:46:22,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:46:22,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-23 14:46:22,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:46:22,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-23 14:46:22,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=4618, Unknown=33, NotChecked=138, Total=5112 [2022-11-23 14:46:22,453 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-11-23 14:46:33,011 WARN L233 SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 145 DAG size of output: 120 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:46:44,678 WARN L233 SmtUtils]: Spent 11.38s on a formula simplification. DAG size of input: 161 DAG size of output: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:47:04,300 WARN L233 SmtUtils]: Spent 17.12s on a formula simplification. DAG size of input: 150 DAG size of output: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:47:15,705 WARN L233 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 110 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:47:22,495 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 125 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:47:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:47:27,588 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-11-23 14:47:27,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-23 14:47:27,589 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-11-23 14:47:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:47:27,590 INFO L225 Difference]: With dead ends: 44 [2022-11-23 14:47:27,590 INFO L226 Difference]: Without dead ends: 44 [2022-11-23 14:47:27,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1853 ImplicationChecksByTransitivity, 70.0s TimeCoverageRelationStatistics Valid=922, Invalid=9528, Unknown=60, NotChecked=202, Total=10712 [2022-11-23 14:47:27,592 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 216 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 111 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:47:27,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 876 Invalid, 32 Unknown, 31 Unchecked, 1.8s Time] [2022-11-23 14:47:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-23 14:47:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-11-23 14:47:27,596 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-11-23 14:47:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-11-23 14:47:27,596 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 25 [2022-11-23 14:47:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:47:27,597 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-11-23 14:47:27,597 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-11-23 14:47:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-11-23 14:47:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 14:47:27,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:47:27,598 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1] [2022-11-23 14:47:27,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:47:27,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 14:47:27,810 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 14:47:27,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:47:27,810 INFO L85 PathProgramCache]: Analyzing trace with hash -278608454, now seen corresponding path program 5 times [2022-11-23 14:47:27,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:47:27,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841892903] [2022-11-23 14:47:27,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:47:27,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:47:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:47:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:47:31,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:47:31,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841892903] [2022-11-23 14:47:31,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841892903] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:47:31,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039256787] [2022-11-23 14:47:31,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:47:31,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:47:31,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:47:31,247 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:47:31,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 14:47:31,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-11-23 14:47:31,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:47:31,642 WARN L261 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 223 conjunts are in the unsatisfiable core [2022-11-23 14:47:31,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:47:31,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-23 14:47:31,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:47:32,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-23 14:47:32,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 31 treesize of output 29 [2022-11-23 14:47:33,323 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-11-23 14:47:34,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-11-23 14:47:34,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2022-11-23 14:47:35,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2022-11-23 14:47:36,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2022-11-23 14:47:38,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 67 [2022-11-23 14:47:39,056 INFO L321 Elim1Store]: treesize reduction 32, result has 56.2 percent of original size [2022-11-23 14:47:39,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 79 [2022-11-23 14:47:39,065 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-11-23 14:47:39,088 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-11-23 14:47:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:47:39,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:48:43,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:48:43,937 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-11-23 14:48:43,951 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-11-23 14:48:43,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:48:43,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:48:43,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:48:43,998 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-11-23 14:48:44,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-23 14:48:44,161 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-11-23 14:48:44,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:48:44,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:48:44,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:48:44,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:48:44,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:48:44,453 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:48:44,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039256787] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:48:44,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [270684722] [2022-11-23 14:48:44,455 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-23 14:48:44,455 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:48:44,456 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:48:44,456 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:48:44,456 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:48:44,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:48:44,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-23 14:48:44,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-23 14:48:44,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:48:44,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:48:44,609 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 14:48:44,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-23 14:48:44,701 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:48:44,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:48:44,759 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:48:44,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:48:44,766 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:48:47,680 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2179#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-11-23 14:48:47,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:48:47,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:48:47,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 39, 39] total 107 [2022-11-23 14:48:47,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493156922] [2022-11-23 14:48:47,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:48:47,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-11-23 14:48:47,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:48:47,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-11-23 14:48:47,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=773, Invalid=12036, Unknown=301, NotChecked=0, Total=13110 [2022-11-23 14:48:47,690 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-11-23 14:51:48,804 WARN L233 SmtUtils]: Spent 2.75m on a formula simplification. DAG size of input: 283 DAG size of output: 267 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:51:50,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:51:51,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:51:53,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:51:55,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:51:57,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:51:59,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:52:02,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:52:03,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:52:05,518 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post206#1.base|)) (.cse32 (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse35 (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse31 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse34 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse30 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse28 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse37 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse27 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (let ((.cse15 (<= .cse37 .cse27)) (.cse16 (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_293))) (or (= (select (select .cse41 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse41 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse34) 0) (= (select (select (store .cse41 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse30) 0) (= 0 (select (select (store .cse41 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse28)))))) (.cse17 (not (<= 0 .cse34))) (.cse18 (not (<= 0 .cse30))) (.cse19 (<= .cse34 .cse27)) (.cse20 (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_295))) (or (= (select (select .cse40 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse40 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse30) 0))))) (.cse1 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_291))) (or (= (select (select (store .cse39 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse28) 0) (= (select (select (store .cse39 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse34) 0) (= (select (select (store .cse39 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse37) 0) (= (select (select .cse39 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse39 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse30) 0) (= (select (select (store .cse39 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse31) 0))))) (.cse2 (<= .cse35 .cse27)) (.cse4 (not (<= 0 .cse37))) (.cse24 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_290))) (or (= (select (select (store .cse38 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse28) 0) (= (select (select .cse38 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse38 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse34) 0) (= (select (select (store .cse38 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse30) 0) (= (select (select (store .cse38 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse31) 0) (= (select (select (store .cse38 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse37) 0) (= (select (select (store .cse38 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse32) 0))))) (.cse25 (not (<= 0 .cse32))) (.cse26 (<= (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse27)) (.cse9 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (v_ArrVal_289 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_289))) (or (= 0 (select (select (store .cse36 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse35)) (= (select (select (store .cse36 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse31) 0) (= (select (select (store .cse36 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse32) 0) (= (select (select (store .cse36 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse37) 0) (= (select (select (store .cse36 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse30) 0) (= (select (select (store .cse36 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse28) 0) (= (select (select (store .cse36 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse34) 0) (= (select (select .cse36 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0))))) (.cse10 (<= (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse27)) (.cse11 (not (<= 0 .cse35))) (.cse21 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_292))) (or (= 0 (select (select (store .cse33 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse34)) (= (select (select (store .cse33 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse30) 0) (= (select (select .cse33 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse33 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse31) 0) (= (select (select (store .cse33 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse28) 0))))) (.cse22 (<= .cse32 .cse27)) (.cse23 (not (<= 0 .cse31))) (.cse8 (= (select .cse0 |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset|) 0)) (.cse12 (not (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) (.cse13 (<= .cse28 .cse27)) (.cse14 (forall ((v_ArrVal_296 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) (.cse5 (<= .cse31 .cse27)) (.cse6 (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_294))) (or (= (select (select .cse29 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse29 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse28) 0) (= (select (select (store .cse29 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse30) 0))))) (.cse7 (not (<= 0 .cse28))) (.cse3 (= |c_ULTIMATE.start_cstrcpy_#t~mem207#1| 0))) (and (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (= (select .cse0 (+ (- 1) |ULTIMATE.start_main_~length2~0#1|)) 0) (<= |ULTIMATE.start_main_~length2~0#1| (select |c_#length| |c_ULTIMATE.start_cstrcpy_#t~post206#1.base|)) (<= 1 |ULTIMATE.start_main_~length2~0#1|))) (or .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11 .cse3) (or .cse12 .cse13 .cse14 .cse8) (= 0 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) (or .cse15 .cse16 .cse3 .cse17) (or .cse15 .cse16 .cse17 .cse8) (not (= (select .cse0 6) 0)) (or .cse18 .cse19 .cse20 .cse8) (not (= (select .cse0 5) 0)) (not (= (select .cse0 3) 0)) (or .cse18 .cse19 .cse20 .cse3) (= (+ |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or .cse1 .cse2 .cse4 .cse8) (= 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or .cse21 .cse22 .cse3 .cse23) (not (= (select .cse0 4) 0)) (or .cse24 .cse25 .cse26 .cse8) (= |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset| 8) (not (= 0 (select .cse0 1))) (or .cse24 .cse25 .cse26 .cse3) (or .cse9 .cse10 .cse11 .cse8) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (not (= (select .cse0 7) 0)) (or .cse21 .cse22 .cse23 .cse8) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (not (= (select .cse0 0) 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)))) (not (= (select .cse0 2) 0)) (or .cse12 .cse13 .cse14 .cse3) (= |c_ULTIMATE.start_cstrcpy_#t~post206#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (or .cse5 .cse6 .cse7 .cse3) (or (<= 10 .cse27) (and (<= 9 .cse27) .cse3))))) is different from true [2022-11-23 14:52:07,464 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse6 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse2 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse8 (+ 6 |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)) (.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse5 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse3 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (and (or (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) .cse1 (<= .cse2 .cse3) (not (<= 0 .cse0)) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0))) (or .cse1 (not (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (<= .cse0 .cse3)) (<= 10 .cse3) (or .cse1 (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) (<= .cse6 .cse3) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (not (<= 0 .cse5))) (= 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0)) .cse1 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse8) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_290 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (<= (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse3) (not (<= 0 .cse7)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0))) (or .cse1 (<= .cse8 .cse3) (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (not (<= 0 .cse2))) (or .cse1 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (<= .cse7 .cse3) (not (<= 0 .cse6))) (or (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) .cse1 (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (not (<= 0 .cse8)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (<= (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse3) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse8) 0))) (or .cse1 (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (not (<= 0 .cse4)) (<= .cse5 .cse3)))) is different from false [2022-11-23 14:53:36,695 WARN L233 SmtUtils]: Spent 1.44m on a formula simplification. DAG size of input: 200 DAG size of output: 185 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:53:38,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:53:40,519 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-11-23 14:53:44,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:53:45,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:53:47,156 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-11-23 14:53:49,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:53:51,208 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-11-23 14:57:00,514 WARN L233 SmtUtils]: Spent 2.68m on a formula simplification. DAG size of input: 210 DAG size of output: 195 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:57:02,528 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-11-23 14:57:03,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:57:04,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:57:06,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:57:10,473 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse7 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse2 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse8 (+ 6 |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)) (.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse6 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse3 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (and (or (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) .cse1 (<= .cse2 .cse3) (not (<= 0 .cse0)) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0))) (or .cse1 (not .cse5) (<= .cse0 .cse3)) .cse5 (or .cse1 (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (<= .cse7 .cse3) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (not (<= 0 .cse6))) (<= .cse4 .cse3) (or .cse1 (<= .cse8 .cse3) (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (not (<= 0 .cse2))) (or .cse1 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (<= (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse3) (not (<= 0 .cse7))) (or (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) .cse1 (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (not (<= 0 .cse8)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (<= (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse3) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse8) 0))) (or .cse1 (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (not (<= 0 .cse4)) (<= .cse6 .cse3)))) is different from false [2022-11-23 14:58:02,896 WARN L233 SmtUtils]: Spent 44.34s on a formula simplification. DAG size of input: 161 DAG size of output: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:58:05,675 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-11-23 14:58:07,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:58:10,161 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-11-23 14:59:21,148 WARN L233 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 174 DAG size of output: 158 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:59:23,155 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-11-23 14:59:25,948 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-11-23 14:59:28,259 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-11-23 14:59:33,566 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse2 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse0 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse7 (+ 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)) (.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse6 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse3 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (and (or (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) .cse1 (<= .cse2 .cse3) (not (<= 0 .cse0)) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0))) (or .cse1 (not .cse5) (<= .cse0 .cse3)) .cse5 (or .cse1 (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (<= .cse7 .cse3) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (not (<= 0 .cse6))) (<= .cse4 .cse3) (or .cse1 (<= (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse3) (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (not (<= 0 .cse2))) (or .cse1 (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_293 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_294 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (<= (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse3) (not (<= 0 .cse7))) (or .cse1 (forall ((v_ArrVal_296 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_296) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)) (not (<= 0 .cse4)) (<= .cse6 .cse3)))) is different from false [2022-11-23 14:59:46,607 WARN L233 SmtUtils]: Spent 6.78s 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-11-23 15:00:19,835 WARN L233 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 62 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 15:00:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:00:23,704 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-11-23 15:00:23,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-23 15:00:23,705 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-11-23 15:00:23,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:00:23,706 INFO L225 Difference]: With dead ends: 78 [2022-11-23 15:00:23,706 INFO L226 Difference]: Without dead ends: 78 [2022-11-23 15:00:23,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5209 ImplicationChecksByTransitivity, 712.5s TimeCoverageRelationStatistics Valid=2306, Invalid=26303, Unknown=477, NotChecked=1364, Total=30450 [2022-11-23 15:00:23,712 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 212 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 349 mSolverCounterUnsat, 107 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 107 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 57.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:00:23,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 4 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 2254 Invalid, 107 Unknown, 4 Unchecked, 57.2s Time] [2022-11-23 15:00:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-23 15:00:23,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-23 15:00:23,716 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-11-23 15:00:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2022-11-23 15:00:23,717 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 41 [2022-11-23 15:00:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:00:23,718 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2022-11-23 15:00:23,718 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-11-23 15:00:23,718 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-11-23 15:00:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-23 15:00:23,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:00:23,720 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1] [2022-11-23 15:00:23,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-23 15:00:23,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 15:00:23,925 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:00:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:00:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1343842754, now seen corresponding path program 6 times [2022-11-23 15:00:23,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:00:23,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961318369] [2022-11-23 15:00:23,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:00:23,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:00:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:00:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:00:33,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:00:33,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961318369] [2022-11-23 15:00:33,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961318369] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:00:33,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795914278] [2022-11-23 15:00:33,292 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 15:00:33,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:00:33,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:00:33,293 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:00:33,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1236fd5d-c6a0-418c-9fb3-8a383b472b9a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process