./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur --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 0942d3c46657b9d8ac8f8537aec24fbcc2f0b19e897472dc297ad201df07c1bb --- 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-38b53e6 [2022-11-25 23:50:21,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:50:21,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:50:21,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:50:21,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:50:21,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:50:21,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:50:21,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:50:21,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:50:21,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:50:21,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:50:21,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:50:21,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:50:21,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:50:21,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:50:21,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:50:21,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:50:21,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:50:21,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:50:21,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:50:21,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:50:21,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:50:21,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:50:21,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:50:21,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:50:21,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:50:21,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:50:21,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:50:21,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:50:21,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:50:21,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:50:21,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:50:21,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:50:21,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:50:21,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:50:21,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:50:21,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:50:21,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:50:21,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:50:21,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:50:21,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:50:21,557 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-11-25 23:50:21,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:50:21,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:50:21,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:50:21,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:50:21,601 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:50:21,601 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:50:21,602 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:50:21,602 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:50:21,602 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:50:21,602 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:50:21,603 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:50:21,604 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:50:21,604 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:50:21,604 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:50:21,604 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:50:21,605 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:50:21,605 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:50:21,605 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:50:21,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:50:21,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:50:21,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:50:21,606 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:50:21,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:50:21,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:50:21,608 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:50:21,608 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:50:21,608 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:50:21,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:50:21,609 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:50:21,609 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:50:21,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:50:21,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:50:21,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:50:21,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:50:21,610 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:50:21,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:50:21,611 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:50:21,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:50:21,611 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:50:21,611 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_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/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_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur 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 -> 0942d3c46657b9d8ac8f8537aec24fbcc2f0b19e897472dc297ad201df07c1bb [2022-11-25 23:50:21,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:50:21,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:50:21,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:50:21,954 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:50:21,955 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:50:21,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i [2022-11-25 23:50:24,968 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:50:25,304 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:50:25,304 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/sv-benchmarks/c/termination-15/cstrspn_diffterm_alloca.i [2022-11-25 23:50:25,316 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/data/861dd9178/6c0a281019934eeb98f1d63809f4ee57/FLAG28de1f66e [2022-11-25 23:50:25,331 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/data/861dd9178/6c0a281019934eeb98f1d63809f4ee57 [2022-11-25 23:50:25,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:50:25,335 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:50:25,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:50:25,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:50:25,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:50:25,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:50:25" (1/1) ... [2022-11-25 23:50:25,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5d64ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25, skipping insertion in model container [2022-11-25 23:50:25,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:50:25" (1/1) ... [2022-11-25 23:50:25,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:50:25,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:50:25,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:50:25,789 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:50:25,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:50:25,894 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:50:25,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25 WrapperNode [2022-11-25 23:50:25,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:50:25,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:50:25,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:50:25,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:50:25,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25" (1/1) ... [2022-11-25 23:50:25,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25" (1/1) ... [2022-11-25 23:50:25,944 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2022-11-25 23:50:25,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:50:25,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:50:25,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:50:25,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:50:25,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25" (1/1) ... [2022-11-25 23:50:25,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25" (1/1) ... [2022-11-25 23:50:25,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25" (1/1) ... [2022-11-25 23:50:25,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25" (1/1) ... [2022-11-25 23:50:25,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25" (1/1) ... [2022-11-25 23:50:25,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25" (1/1) ... [2022-11-25 23:50:25,987 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25" (1/1) ... [2022-11-25 23:50:26,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25" (1/1) ... [2022-11-25 23:50:26,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:50:26,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:50:26,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:50:26,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:50:26,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25" (1/1) ... [2022-11-25 23:50:26,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:50:26,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:26,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:50:26,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:50:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:50:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:50:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:50:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:50:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:50:26,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:50:26,171 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:50:26,173 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:50:26,415 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:50:26,473 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:50:26,474 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 23:50:26,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:50:26 BoogieIcfgContainer [2022-11-25 23:50:26,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:50:26,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:50:26,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:50:26,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:50:26,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:50:25" (1/3) ... [2022-11-25 23:50:26,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31904158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:50:26, skipping insertion in model container [2022-11-25 23:50:26,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:25" (2/3) ... [2022-11-25 23:50:26,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31904158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:50:26, skipping insertion in model container [2022-11-25 23:50:26,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:50:26" (3/3) ... [2022-11-25 23:50:26,486 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrspn_diffterm_alloca.i [2022-11-25 23:50:26,505 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:50:26,506 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-11-25 23:50:26,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:50:26,556 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;@596245c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:50:26,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-11-25 23:50:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 15 states have (on average 2.4) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:26,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-25 23:50:26,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:26,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-25 23:50:26,568 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:26,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 3923, now seen corresponding path program 1 times [2022-11-25 23:50:26,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:26,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967011610] [2022-11-25 23:50:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:26,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:27,011 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-25 23:50:27,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:27,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967011610] [2022-11-25 23:50:27,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967011610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:27,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:27,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:50:27,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745626202] [2022-11-25 23:50:27,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:27,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:50:27,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:27,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:50:27,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:50:27,053 INFO L87 Difference]: Start difference. First operand has 31 states, 15 states have (on average 2.4) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:27,110 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-11-25 23:50:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:50:27,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-25 23:50:27,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:27,121 INFO L225 Difference]: With dead ends: 30 [2022-11-25 23:50:27,121 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 23:50:27,123 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-25 23:50:27,126 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:27,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:27,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 23:50:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-25 23:50:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-25 23:50:27,172 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 2 [2022-11-25 23:50:27,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:27,173 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-25 23:50:27,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-25 23:50:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-25 23:50:27,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:27,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-25 23:50:27,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:50:27,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:27,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:27,183 INFO L85 PathProgramCache]: Analyzing trace with hash 3924, now seen corresponding path program 1 times [2022-11-25 23:50:27,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:27,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610995675] [2022-11-25 23:50:27,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:27,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:27,540 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-25 23:50:27,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:27,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610995675] [2022-11-25 23:50:27,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610995675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:27,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:27,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:50:27,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898659697] [2022-11-25 23:50:27,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:27,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:50:27,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:27,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:50:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:50:27,545 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:27,582 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-25 23:50:27,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:50:27,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-25 23:50:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:27,583 INFO L225 Difference]: With dead ends: 28 [2022-11-25 23:50:27,584 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 23:50:27,584 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-25 23:50:27,585 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:27,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 16 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 23:50:27,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-25 23:50:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 2.066666666666667) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-11-25 23:50:27,590 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 2 [2022-11-25 23:50:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:27,591 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-25 23:50:27,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-11-25 23:50:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:50:27,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:27,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:50:27,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:50:27,593 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:27,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:27,594 INFO L85 PathProgramCache]: Analyzing trace with hash 121602, now seen corresponding path program 1 times [2022-11-25 23:50:27,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:27,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92557736] [2022-11-25 23:50:27,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:27,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:27,675 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-25 23:50:27,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:27,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92557736] [2022-11-25 23:50:27,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92557736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:27,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:27,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:50:27,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401195113] [2022-11-25 23:50:27,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:27,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:50:27,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:27,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:50:27,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:50:27,678 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. 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-25 23:50:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:27,722 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-11-25 23:50:27,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:50:27,723 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-25 23:50:27,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:27,724 INFO L225 Difference]: With dead ends: 27 [2022-11-25 23:50:27,726 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 23:50:27,727 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-25 23:50:27,728 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:27,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 14 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 23:50:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-25 23:50:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 2.0) internal successors, (30), 26 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-25 23:50:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-11-25 23:50:27,739 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 3 [2022-11-25 23:50:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:27,740 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-11-25 23:50:27,740 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-25 23:50:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-11-25 23:50:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:50:27,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:27,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:50:27,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:50:27,742 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:27,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:27,748 INFO L85 PathProgramCache]: Analyzing trace with hash 121603, now seen corresponding path program 1 times [2022-11-25 23:50:27,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:27,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393928374] [2022-11-25 23:50:27,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:27,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:27,949 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-25 23:50:27,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:27,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393928374] [2022-11-25 23:50:27,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393928374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:27,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:27,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:50:27,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802519644] [2022-11-25 23:50:27,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:27,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:50:27,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:27,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:50:27,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:50:27,956 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. 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-25 23:50:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:28,011 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-11-25 23:50:28,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:50:28,012 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-25 23:50:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:28,013 INFO L225 Difference]: With dead ends: 26 [2022-11-25 23:50:28,013 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 23:50:28,014 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-25 23:50:28,019 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:28,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 15 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 23:50:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-25 23:50:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 25 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-25 23:50:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-11-25 23:50:28,023 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 3 [2022-11-25 23:50:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:28,024 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-11-25 23:50:28,024 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-25 23:50:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-11-25 23:50:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:50:28,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:28,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:50:28,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:50:28,025 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:28,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:28,026 INFO L85 PathProgramCache]: Analyzing trace with hash 3771828, now seen corresponding path program 1 times [2022-11-25 23:50:28,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:28,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066593001] [2022-11-25 23:50:28,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:28,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:28,110 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-25 23:50:28,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:28,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066593001] [2022-11-25 23:50:28,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066593001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:28,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:28,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:50:28,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409808546] [2022-11-25 23:50:28,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:28,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:50:28,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:28,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:50:28,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:50:28,115 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:28,190 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-11-25 23:50:28,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:50:28,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 23:50:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:28,192 INFO L225 Difference]: With dead ends: 24 [2022-11-25 23:50:28,193 INFO L226 Difference]: Without dead ends: 24 [2022-11-25 23:50:28,194 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-25 23:50:28,196 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:28,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 12 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-25 23:50:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-25 23:50:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.8) internal successors, (27), 23 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-25 23:50:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-25 23:50:28,199 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 4 [2022-11-25 23:50:28,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:28,200 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-25 23:50:28,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-25 23:50:28,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:50:28,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:28,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:50:28,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:50:28,201 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:28,202 INFO L85 PathProgramCache]: Analyzing trace with hash 3771829, now seen corresponding path program 1 times [2022-11-25 23:50:28,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:28,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315182465] [2022-11-25 23:50:28,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:28,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:28,413 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-25 23:50:28,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:28,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315182465] [2022-11-25 23:50:28,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315182465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:28,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:28,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:50:28,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639439359] [2022-11-25 23:50:28,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:28,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:50:28,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:28,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:50:28,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:50:28,416 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:28,480 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-11-25 23:50:28,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:50:28,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 23:50:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:28,482 INFO L225 Difference]: With dead ends: 43 [2022-11-25 23:50:28,482 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 23:50:28,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:50:28,483 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 115 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:28,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 22 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 23:50:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-11-25 23:50:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 26 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-25 23:50:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-25 23:50:28,488 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 4 [2022-11-25 23:50:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:28,488 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-25 23:50:28,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-25 23:50:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:50:28,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:28,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:28,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:50:28,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:28,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash 697382883, now seen corresponding path program 1 times [2022-11-25 23:50:28,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:28,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351066587] [2022-11-25 23:50:28,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:28,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:28,550 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-25 23:50:28,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:28,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351066587] [2022-11-25 23:50:28,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351066587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:28,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:28,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:50:28,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226656599] [2022-11-25 23:50:28,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:28,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:50:28,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:28,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:50:28,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:50:28,553 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:28,596 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-11-25 23:50:28,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:50:28,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:50:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:28,598 INFO L225 Difference]: With dead ends: 26 [2022-11-25 23:50:28,598 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 23:50:28,598 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-25 23:50:28,599 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:28,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 14 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:28,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 23:50:28,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-11-25 23:50:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 23 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-25 23:50:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-25 23:50:28,602 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 7 [2022-11-25 23:50:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:28,602 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-25 23:50:28,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-25 23:50:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:50:28,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:28,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:28,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:50:28,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:28,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:28,605 INFO L85 PathProgramCache]: Analyzing trace with hash 697382884, now seen corresponding path program 1 times [2022-11-25 23:50:28,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:28,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71884836] [2022-11-25 23:50:28,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:28,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:28,751 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-25 23:50:28,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:28,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71884836] [2022-11-25 23:50:28,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71884836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:28,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:28,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:50:28,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216160322] [2022-11-25 23:50:28,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:28,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:50:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:28,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:50:28,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:50:28,754 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:28,841 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-11-25 23:50:28,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:50:28,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:50:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:28,843 INFO L225 Difference]: With dead ends: 37 [2022-11-25 23:50:28,843 INFO L226 Difference]: Without dead ends: 37 [2022-11-25 23:50:28,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-25 23:50:28,844 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 77 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:28,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 20 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:50:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-25 23:50:28,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2022-11-25 23:50:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-25 23:50:28,848 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2022-11-25 23:50:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:28,849 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-25 23:50:28,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,849 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-25 23:50:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:50:28,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:28,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:28,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:50:28,850 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:28,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:28,851 INFO L85 PathProgramCache]: Analyzing trace with hash 143965859, now seen corresponding path program 1 times [2022-11-25 23:50:28,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:28,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717597526] [2022-11-25 23:50:28,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:28,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:28,994 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-25 23:50:28,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:28,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717597526] [2022-11-25 23:50:28,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717597526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:28,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:28,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:50:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685030201] [2022-11-25 23:50:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:28,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:50:28,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:28,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:50:28,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:50:28,998 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-25 23:50:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:29,024 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-25 23:50:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:50:29,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 23:50:29,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:29,028 INFO L225 Difference]: With dead ends: 28 [2022-11-25 23:50:29,028 INFO L226 Difference]: Without dead ends: 25 [2022-11-25 23:50:29,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:50:29,031 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:29,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:29,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-25 23:50:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-25 23:50:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 24 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-25 23:50:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-25 23:50:29,045 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 8 [2022-11-25 23:50:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:29,045 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-25 23:50:29,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-25 23:50:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-25 23:50:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:50:29,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:29,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:29,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:50:29,047 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash 978021303, now seen corresponding path program 1 times [2022-11-25 23:50:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:29,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267791483] [2022-11-25 23:50:29,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:29,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:29,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267791483] [2022-11-25 23:50:29,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267791483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:29,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:29,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:50:29,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50129062] [2022-11-25 23:50:29,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:29,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:50:29,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:29,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:50:29,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:50:29,105 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) 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-25 23:50:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:29,129 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-11-25 23:50:29,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:50:29,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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-25 23:50:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:29,131 INFO L225 Difference]: With dead ends: 27 [2022-11-25 23:50:29,131 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 23:50:29,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-25 23:50:29,132 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:29,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:50:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 23:50:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-25 23:50:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 26 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-25 23:50:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-25 23:50:29,147 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2022-11-25 23:50:29,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:29,147 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-25 23:50:29,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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-25 23:50:29,148 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-25 23:50:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:50:29,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:29,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:29,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:50:29,149 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:29,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:29,150 INFO L85 PathProgramCache]: Analyzing trace with hash 253734179, now seen corresponding path program 1 times [2022-11-25 23:50:29,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:29,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74732991] [2022-11-25 23:50:29,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:29,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:29,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:29,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74732991] [2022-11-25 23:50:29,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74732991] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:29,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012709423] [2022-11-25 23:50:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:29,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:29,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:29,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:29,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:50:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:29,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 23:50:29,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:29,882 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:50:29,883 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-25 23:50:29,956 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-25 23:50:30,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:50:30,204 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 32 treesize of output 29 [2022-11-25 23:50:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:30,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:30,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-11-25 23:50:30,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-25 23:50:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:30,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012709423] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:30,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1508394885] [2022-11-25 23:50:30,708 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-25 23:50:30,708 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:50:30,712 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:50:30,718 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:50:30,718 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:50:30,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:30,776 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-25 23:50:30,830 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-25 23:50:30,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:30,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 23:50:31,510 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:50:33,886 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '723#(and (<= 0 |ULTIMATE.start_cstrspn_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc215#1.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_~s~0#1.offset|) (<= 0 |ULTIMATE.start_cstrspn_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrspn_~s1#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc216#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_#in~s2#1.offset|) (<= |ULTIMATE.start_cstrspn_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_~s2#1.base|) (<= 0 |ULTIMATE.start_cstrspn_~s~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc216#1.base|) (<= 0 |ULTIMATE.start_cstrspn_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= |ULTIMATE.start_cstrspn_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrspn_#in~s1#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc215#1.base|) (<= |ULTIMATE.start_cstrspn_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrspn_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-25 23:50:33,886 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:50:33,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:33,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-25 23:50:33,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817233821] [2022-11-25 23:50:33,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:50:33,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 23:50:33,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:33,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 23:50:33,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:50:33,888 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:34,729 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-11-25 23:50:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:50:34,730 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 23:50:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:34,732 INFO L225 Difference]: With dead ends: 44 [2022-11-25 23:50:34,732 INFO L226 Difference]: Without dead ends: 44 [2022-11-25 23:50:34,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=286, Invalid=1120, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 23:50:34,733 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 213 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:34,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 9 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:50:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-25 23:50:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 24. [2022-11-25 23:50:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 23 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-25 23:50:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-25 23:50:34,737 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2022-11-25 23:50:34,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:34,737 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-25 23:50:34,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-25 23:50:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 23:50:34,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:34,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:34,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:50:34,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:34,943 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:34,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:34,944 INFO L85 PathProgramCache]: Analyzing trace with hash -719403340, now seen corresponding path program 1 times [2022-11-25 23:50:34,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:34,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107361320] [2022-11-25 23:50:34,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:34,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:35,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:35,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107361320] [2022-11-25 23:50:35,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107361320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:35,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:35,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:50:35,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346335709] [2022-11-25 23:50:35,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:35,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:50:35,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:35,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:50:35,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:50:35,074 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:35,181 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-11-25 23:50:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:50:35,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 23:50:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:35,183 INFO L225 Difference]: With dead ends: 26 [2022-11-25 23:50:35,184 INFO L226 Difference]: Without dead ends: 23 [2022-11-25 23:50:35,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:50:35,185 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:35,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 20 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:50:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-25 23:50:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-25 23:50:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-11-25 23:50:35,190 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 12 [2022-11-25 23:50:35,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:35,190 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-11-25 23:50:35,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-11-25 23:50:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:50:35,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:35,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:35,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:50:35,193 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:35,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:35,195 INFO L85 PathProgramCache]: Analyzing trace with hash -974627552, now seen corresponding path program 1 times [2022-11-25 23:50:35,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:35,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448923962] [2022-11-25 23:50:35,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:35,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:35,605 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:35,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448923962] [2022-11-25 23:50:35,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448923962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:35,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580660158] [2022-11-25 23:50:35,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:35,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:35,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:35,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:35,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:50:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:35,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 23:50:35,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:35,698 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-25 23:50:35,722 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-25 23:50:35,779 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 17 treesize of output 19 [2022-11-25 23:50:36,223 INFO L321 Elim1Store]: treesize reduction 3, result has 92.7 percent of original size [2022-11-25 23:50:36,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 51 [2022-11-25 23:50:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:36,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:36,841 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:50:36,842 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 40 [2022-11-25 23:50:36,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:50:36,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 114 [2022-11-25 23:50:36,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:50:36,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2022-11-25 23:50:36,901 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-25 23:50:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:37,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580660158] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:37,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1226623109] [2022-11-25 23:50:37,104 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-25 23:50:37,104 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:50:37,105 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:50:37,105 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:50:37,105 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:50:37,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:37,132 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-25 23:50:37,165 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-25 23:50:37,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:37,221 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 25 treesize of output 24 [2022-11-25 23:50:37,983 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:50:39,644 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '984#(and (<= 0 |ULTIMATE.start_cstrspn_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc215#1.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrspn_~s1#1.base|) (< (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc216#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_cstrspn_#in~s2#1.offset|) (<= |ULTIMATE.start_cstrspn_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc216#1.base|) (<= 0 |ULTIMATE.start_cstrspn_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= |ULTIMATE.start_cstrspn_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrspn_#in~s1#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc215#1.base|) (<= |ULTIMATE.start_cstrspn_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrspn_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-25 23:50:39,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:50:39,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:39,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2022-11-25 23:50:39,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742388318] [2022-11-25 23:50:39,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:50:39,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 23:50:39,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:39,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 23:50:39,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1042, Unknown=3, NotChecked=0, Total=1190 [2022-11-25 23:50:39,647 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-25 23:50:41,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:41,669 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-11-25 23:50:41,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 23:50:41,670 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 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-25 23:50:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:41,670 INFO L225 Difference]: With dead ends: 64 [2022-11-25 23:50:41,671 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 23:50:41,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=500, Invalid=2149, Unknown=3, NotChecked=0, Total=2652 [2022-11-25 23:50:41,672 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 256 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:41,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 29 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:50:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 23:50:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2022-11-25 23:50:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-25 23:50:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2022-11-25 23:50:41,677 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 13 [2022-11-25 23:50:41,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:41,678 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2022-11-25 23:50:41,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-25 23:50:41,678 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-11-25 23:50:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 23:50:41,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:41,679 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:41,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:50:41,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 23:50:41,880 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:41,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:41,881 INFO L85 PathProgramCache]: Analyzing trace with hash -236754206, now seen corresponding path program 2 times [2022-11-25 23:50:41,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:41,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886943101] [2022-11-25 23:50:41,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:41,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:42,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:42,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886943101] [2022-11-25 23:50:42,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886943101] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:42,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982232784] [2022-11-25 23:50:42,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:50:42,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:42,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:42,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:42,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:50:42,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:50:42,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:50:42,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 23:50:42,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:42,602 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-25 23:50:47,229 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-25 23:50:47,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 36 [2022-11-25 23:50:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:47,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:47,945 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 27 treesize of output 23 [2022-11-25 23:50:47,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:50:47,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2022-11-25 23:50:47,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 65 [2022-11-25 23:50:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:48,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982232784] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:48,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [816470700] [2022-11-25 23:50:48,016 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-25 23:50:48,016 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:50:48,017 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:50:48,017 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:50:48,017 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:50:48,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:48,043 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-25 23:50:48,074 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-25 23:50:48,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:48,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 23:50:48,527 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:50:51,080 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1252#(and (<= 0 |ULTIMATE.start_cstrspn_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc215#1.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_~s~0#1.offset|) (<= 0 |ULTIMATE.start_cstrspn_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrspn_~s1#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc216#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_#in~s2#1.offset|) (<= |ULTIMATE.start_cstrspn_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_~s2#1.base|) (<= 0 |ULTIMATE.start_cstrspn_~s~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc216#1.base|) (<= 0 |ULTIMATE.start_cstrspn_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= |ULTIMATE.start_cstrspn_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrspn_#in~s1#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc215#1.base|) (<= |ULTIMATE.start_cstrspn_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrspn_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-25 23:50:51,080 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:50:51,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:51,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2022-11-25 23:50:51,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851036172] [2022-11-25 23:50:51,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:50:51,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 23:50:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:51,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 23:50:51,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1160, Unknown=2, NotChecked=0, Total=1332 [2022-11-25 23:50:51,083 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 29 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:53,285 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] [2022-11-25 23:50:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:58,011 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2022-11-25 23:50:58,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 23:50:58,012 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 23:50:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:58,012 INFO L225 Difference]: With dead ends: 153 [2022-11-25 23:50:58,013 INFO L226 Difference]: Without dead ends: 153 [2022-11-25 23:50:58,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=482, Invalid=2377, Unknown=3, NotChecked=0, Total=2862 [2022-11-25 23:50:58,014 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 325 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:58,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 25 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-11-25 23:50:58,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-25 23:50:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 84. [2022-11-25 23:50:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 83 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-25 23:50:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2022-11-25 23:50:58,018 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 15 [2022-11-25 23:50:58,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:58,018 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2022-11-25 23:50:58,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2022-11-25 23:50:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 23:50:58,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:58,025 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:58,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:50:58,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 23:50:58,231 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:50:58,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:58,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1201395487, now seen corresponding path program 3 times [2022-11-25 23:50:58,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:58,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970689842] [2022-11-25 23:50:58,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:58,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:59,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:59,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970689842] [2022-11-25 23:50:59,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970689842] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:59,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115163629] [2022-11-25 23:50:59,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:50:59,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:59,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:59,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:59,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:50:59,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:50:59,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:50:59,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 23:50:59,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:59,182 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:50:59,182 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-25 23:50:59,208 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-25 23:51:34,154 INFO L321 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2022-11-25 23:51:34,155 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 72 treesize of output 57 [2022-11-25 23:51:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 17 refuted. 25 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:34,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:51:35,703 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 74 treesize of output 64 [2022-11-25 23:51:35,716 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 74 treesize of output 56 [2022-11-25 23:51:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:35,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115163629] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:51:35,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [149601788] [2022-11-25 23:51:35,836 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-25 23:51:35,836 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:51:35,837 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:51:35,837 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:51:35,837 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:51:35,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:35,864 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-25 23:51:35,898 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-25 23:51:35,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:35,937 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 25 treesize of output 24 [2022-11-25 23:51:36,223 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:51:39,156 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1734#(and (<= 0 |ULTIMATE.start_cstrspn_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc215#1.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_~s~0#1.offset|) (<= 0 |ULTIMATE.start_cstrspn_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrspn_~s1#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc216#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_#in~s2#1.offset|) (<= |ULTIMATE.start_cstrspn_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_~s2#1.base|) (<= 0 |ULTIMATE.start_cstrspn_~s~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc216#1.base|) (<= 0 |ULTIMATE.start_cstrspn_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= |ULTIMATE.start_cstrspn_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrspn_~s~0#1.base|) (+ |ULTIMATE.start_cstrspn_~s~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrspn_#in~s1#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc215#1.base|) (<= |ULTIMATE.start_cstrspn_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrspn_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-25 23:51:39,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:51:39,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:51:39,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 18] total 45 [2022-11-25 23:51:39,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983646763] [2022-11-25 23:51:39,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:51:39,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-25 23:51:39,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:39,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-25 23:51:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=2610, Unknown=28, NotChecked=0, Total=2970 [2022-11-25 23:51:39,171 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 46 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-25 23:51:42,089 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] [2022-11-25 23:51:44,741 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] [2022-11-25 23:51:46,750 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] [2022-11-25 23:51:51,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:51:53,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:51:58,574 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] [2022-11-25 23:52:00,595 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] [2022-11-25 23:52:06,174 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] [2022-11-25 23:52:08,180 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] [2022-11-25 23:52:13,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:52:15,752 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] [2022-11-25 23:52:19,706 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] [2022-11-25 23:52:21,727 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] [2022-11-25 23:52:23,742 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] [2022-11-25 23:52:25,747 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] [2022-11-25 23:52:35,375 WARN L233 SmtUtils]: Spent 5.86s on a formula simplification. DAG size of input: 90 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:52:39,165 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] [2022-11-25 23:52:41,181 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] [2022-11-25 23:52:48,701 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 [0] [2022-11-25 23:52:50,708 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] [2022-11-25 23:52:51,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:52:53,804 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] [2022-11-25 23:53:03,734 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] [2022-11-25 23:53:14,885 WARN L233 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 96 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:53:16,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:53:17,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:53:21,559 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] [2022-11-25 23:53:33,432 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 104 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:53:36,359 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] [2022-11-25 23:53:38,372 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] [2022-11-25 23:53:40,393 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] [2022-11-25 23:53:50,442 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] [2022-11-25 23:53:52,455 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] [2022-11-25 23:53:55,444 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] [2022-11-25 23:54:05,636 WARN L233 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 95 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:54:15,956 WARN L233 SmtUtils]: Spent 7.13s on a formula simplification. DAG size of input: 115 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:54:17,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:54:33,731 WARN L233 SmtUtils]: Spent 15.26s on a formula simplification. DAG size of input: 120 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:54:36,635 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] [2022-11-25 23:54:45,540 WARN L233 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 107 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:54:47,589 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] [2022-11-25 23:55:00,300 WARN L233 SmtUtils]: Spent 10.56s on a formula simplification. DAG size of input: 107 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:55:01,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:55:16,573 WARN L233 SmtUtils]: Spent 10.80s on a formula simplification. DAG size of input: 124 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:55:29,820 WARN L233 SmtUtils]: Spent 8.70s on a formula simplification. DAG size of input: 111 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:55:31,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:55:38,098 WARN L233 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 77 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:55:40,106 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] [2022-11-25 23:55:42,123 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] [2022-11-25 23:55:44,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:55:46,157 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] [2022-11-25 23:55:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:46,189 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2022-11-25 23:55:46,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 23:55:46,189 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 46 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) Word has length 27 [2022-11-25 23:55:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:46,190 INFO L225 Difference]: With dead ends: 152 [2022-11-25 23:55:46,190 INFO L226 Difference]: Without dead ends: 152 [2022-11-25 23:55:46,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 193.4s TimeCoverageRelationStatistics Valid=1120, Invalid=5457, Unknown=65, NotChecked=0, Total=6642 [2022-11-25 23:55:46,193 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 352 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 2 mSolverCounterUnsat, 59 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 92.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 59 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 92.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:46,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 47 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 880 Invalid, 59 Unknown, 0 Unchecked, 92.2s Time] [2022-11-25 23:55:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-25 23:55:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 32. [2022-11-25 23:55:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-25 23:55:46,196 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 27 [2022-11-25 23:55:46,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:46,197 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-25 23:55:46,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 46 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-25 23:55:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-25 23:55:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 23:55:46,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:46,198 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-11-25 23:55:46,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:55:46,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 23:55:46,411 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:55:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1298882368, now seen corresponding path program 2 times [2022-11-25 23:55:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:46,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307277915] [2022-11-25 23:55:46,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:46,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:55:47,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:47,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307277915] [2022-11-25 23:55:47,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307277915] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:55:47,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381968807] [2022-11-25 23:55:47,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:55:47,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:55:47,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:55:47,583 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:55:47,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:55:47,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 23:55:47,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:55:47,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-25 23:55:47,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:55:47,771 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-25 23:55:47,816 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-25 23:55:47,898 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 17 treesize of output 19 [2022-11-25 23:55:50,152 INFO L321 Elim1Store]: treesize reduction 16, result has 73.8 percent of original size [2022-11-25 23:55:50,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 64 [2022-11-25 23:55:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:55:50,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:55:52,352 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrspn_~sc1~0#1.offset_34| Int) (|v_ULTIMATE.start_cstrspn_~sc1~0#1.offset_33| Int) (v_ArrVal_197 (Array Int Int)) (|v_ULTIMATE.start_cstrspn_~sc1~0#1.offset_35| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_197) |c_ULTIMATE.start_main_~nondetString1~0#1.base|)) (.cse1 (select v_ArrVal_197 |c_ULTIMATE.start_main_~nondetString2~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_cstrspn_~sc1~0#1.offset_33|)) (not (= (select .cse0 |v_ULTIMATE.start_cstrspn_~sc1~0#1.offset_35|) .cse1)) (not (<= |v_ULTIMATE.start_cstrspn_~sc1~0#1.offset_33| (+ |v_ULTIMATE.start_cstrspn_~sc1~0#1.offset_34| 1))) (= 49 .cse1) (< |c_ULTIMATE.start_main_~nondetString1~0#1.offset| |v_ULTIMATE.start_cstrspn_~sc1~0#1.offset_35|) (not (= .cse1 (select .cse0 |v_ULTIMATE.start_cstrspn_~sc1~0#1.offset_34|))) (not (= (select .cse0 |v_ULTIMATE.start_cstrspn_~sc1~0#1.offset_33|) .cse1)) (not (<= |v_ULTIMATE.start_cstrspn_~sc1~0#1.offset_34| (+ |v_ULTIMATE.start_cstrspn_~sc1~0#1.offset_35| 1))) (<= (+ 2 |v_ULTIMATE.start_cstrspn_~sc1~0#1.offset_33|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|))))) is different from false [2022-11-25 23:55:52,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:55:52,386 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 51 [2022-11-25 23:55:52,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:55:52,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 137 [2022-11-25 23:55:52,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:55:52,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 106 [2022-11-25 23:55:52,506 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-25 23:55:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:55:52,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381968807] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:55:52,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1100383130] [2022-11-25 23:55:52,899 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-25 23:55:52,900 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:55:52,900 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:55:52,900 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:55:52,900 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:55:52,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:52,942 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-25 23:55:52,970 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-25 23:55:53,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:53,034 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 25 treesize of output 24 [2022-11-25 23:55:53,618 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:55:55,747 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2210#(and (<= 0 |ULTIMATE.start_cstrspn_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc215#1.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_#in~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrspn_~s1#1.base|) (< (select |#length| |ULTIMATE.start_cstrspn_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrspn_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc216#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_cstrspn_#in~s2#1.offset|) (<= |ULTIMATE.start_cstrspn_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrspn_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc216#1.base|) (<= 0 |ULTIMATE.start_cstrspn_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (<= |ULTIMATE.start_cstrspn_#in~s1#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrspn_~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrspn_#in~s1#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc215#1.base|) (<= |ULTIMATE.start_cstrspn_~s2#1.offset| 0) (<= |ULTIMATE.start_cstrspn_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |#NULL.base| 0))' at error location [2022-11-25 23:55:55,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:55:55,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:55:55,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 48 [2022-11-25 23:55:55,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073189774] [2022-11-25 23:55:55,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:55:55,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 23:55:55,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:55,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 23:55:55,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3063, Unknown=1, NotChecked=112, Total=3422 [2022-11-25 23:55:55,750 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 49 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-25 23:56:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:32,131 INFO L93 Difference]: Finished difference Result 258 states and 292 transitions. [2022-11-25 23:56:32,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-11-25 23:56:32,132 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 49 states have internal predecessors, (93), 0 states have call successors, (0), 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 31 [2022-11-25 23:56:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:32,133 INFO L225 Difference]: With dead ends: 258 [2022-11-25 23:56:32,133 INFO L226 Difference]: Without dead ends: 258 [2022-11-25 23:56:32,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7835 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=3854, Invalid=20329, Unknown=1, NotChecked=308, Total=24492 [2022-11-25 23:56:32,139 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 1330 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:32,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 190 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1155 Invalid, 0 Unknown, 84 Unchecked, 2.3s Time] [2022-11-25 23:56:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-25 23:56:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 89. [2022-11-25 23:56:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 88 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-25 23:56:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2022-11-25 23:56:32,143 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 31 [2022-11-25 23:56:32,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:32,144 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2022-11-25 23:56:32,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 49 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-25 23:56:32,144 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2022-11-25 23:56:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 23:56:32,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:32,145 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-11-25 23:56:32,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 23:56:32,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 23:56:32,351 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-25 23:56:32,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash 289045822, now seen corresponding path program 1 times [2022-11-25 23:56:32,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:32,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434706921] [2022-11-25 23:56:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 23:56:33,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:33,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434706921] [2022-11-25 23:56:33,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434706921] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:56:33,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174660095] [2022-11-25 23:56:33,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:33,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:33,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:56:33,206 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:56:33,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6c1eb7-c2d6-4a31-8d03-1cc6f55dddb8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:56:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:33,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-25 23:56:33,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:56:33,328 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-25 23:56:33,358 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-25 23:56:33,423 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 17 treesize of output 19 [2022-11-25 23:56:35,821 INFO L321 Elim1Store]: treesize reduction 45, result has 81.1 percent of original size [2022-11-25 23:56:35,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 75 treesize of output 220 [2022-11-25 23:56:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:56:38,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:56:40,912 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:56:40,912 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 100 [2022-11-25 23:56:41,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:56:41,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 301 treesize of output 451 [2022-11-25 23:56:41,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:56:41,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 198 treesize of output 268 [2022-11-25 23:56:41,281 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