./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS --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 4f531da4514da78f664dbd663145b26ee24930c7e93acdc31160c6cc4e4d5de8 --- 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-8393723 [2022-11-19 06:44:57,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:44:57,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:44:57,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:44:57,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:44:57,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:44:57,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:44:57,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:44:57,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:44:57,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:44:57,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:44:57,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:44:57,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:44:57,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:44:57,317 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:44:57,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:44:57,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:44:57,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:44:57,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:44:57,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:44:57,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:44:57,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:44:57,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:44:57,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:44:57,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:44:57,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:44:57,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:44:57,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:44:57,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:44:57,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:44:57,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:44:57,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:44:57,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:44:57,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:44:57,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:44:57,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:44:57,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:44:57,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:44:57,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:44:57,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:44:57,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:44:57,375 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-11-19 06:44:57,413 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:44:57,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:44:57,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:44:57,414 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:44:57,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:44:57,416 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:44:57,416 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:44:57,416 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:44:57,416 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:44:57,416 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:44:57,418 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:44:57,418 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:44:57,418 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:44:57,418 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:44:57,418 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:44:57,419 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:44:57,419 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:44:57,419 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:44:57,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 06:44:57,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 06:44:57,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:44:57,420 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 06:44:57,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:44:57,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:44:57,421 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 06:44:57,421 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 06:44:57,421 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 06:44:57,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:44:57,422 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 06:44:57,422 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:44:57,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:44:57,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:44:57,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:44:57,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:44:57,424 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:44:57,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:44:57,424 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:44:57,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:44:57,424 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:44:57,425 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_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/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_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS 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 -> 4f531da4514da78f664dbd663145b26ee24930c7e93acdc31160c6cc4e4d5de8 [2022-11-19 06:44:57,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:44:57,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:44:57,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:44:57,712 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:44:57,713 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:44:57,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2022-11-19 06:44:57,791 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/data/108969881/3cda73cec56f46deb9703fecf2c8b41a/FLAGadc912819 [2022-11-19 06:44:58,224 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:44:58,224 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2022-11-19 06:44:58,232 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/data/108969881/3cda73cec56f46deb9703fecf2c8b41a/FLAGadc912819 [2022-11-19 06:44:58,630 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/data/108969881/3cda73cec56f46deb9703fecf2c8b41a [2022-11-19 06:44:58,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:44:58,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:44:58,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:44:58,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:44:58,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:44:58,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:44:58" (1/1) ... [2022-11-19 06:44:58,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36af21f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58, skipping insertion in model container [2022-11-19 06:44:58,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:44:58" (1/1) ... [2022-11-19 06:44:58,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:44:58,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:44:58,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:44:58,860 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:44:58,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:44:58,890 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:44:58,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58 WrapperNode [2022-11-19 06:44:58,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:44:58,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:44:58,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:44:58,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:44:58,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58" (1/1) ... [2022-11-19 06:44:58,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58" (1/1) ... [2022-11-19 06:44:58,930 INFO L138 Inliner]: procedures = 13, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2022-11-19 06:44:58,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:44:58,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:44:58,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:44:58,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:44:58,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58" (1/1) ... [2022-11-19 06:44:58,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58" (1/1) ... [2022-11-19 06:44:58,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58" (1/1) ... [2022-11-19 06:44:58,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58" (1/1) ... [2022-11-19 06:44:58,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58" (1/1) ... [2022-11-19 06:44:58,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58" (1/1) ... [2022-11-19 06:44:58,953 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58" (1/1) ... [2022-11-19 06:44:58,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58" (1/1) ... [2022-11-19 06:44:58,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:44:58,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:44:58,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:44:58,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:44:58,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58" (1/1) ... [2022-11-19 06:44:58,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:44:58,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:44:59,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:44:59,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:44:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2022-11-19 06:44:59,055 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2022-11-19 06:44:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 06:44:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 06:44:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:44:59,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:44:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 06:44:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:44:59,177 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:44:59,179 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:44:59,434 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:44:59,514 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:44:59,514 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 06:44:59,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:44:59 BoogieIcfgContainer [2022-11-19 06:44:59,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:44:59,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:44:59,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:44:59,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:44:59,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:44:58" (1/3) ... [2022-11-19 06:44:59,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57097087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:44:59, skipping insertion in model container [2022-11-19 06:44:59,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:58" (2/3) ... [2022-11-19 06:44:59,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57097087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:44:59, skipping insertion in model container [2022-11-19 06:44:59,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:44:59" (3/3) ... [2022-11-19 06:44:59,533 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_strcopy_malloc.i [2022-11-19 06:44:59,552 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:44:59,552 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-11-19 06:44:59,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:44:59,609 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;@2b51cde5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:44:59,609 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-11-19 06:44:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 16 states have (on average 2.0) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:44:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 06:44:59,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:44:59,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 06:44:59,622 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:44:59,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:44:59,629 INFO L85 PathProgramCache]: Analyzing trace with hash 3068, now seen corresponding path program 1 times [2022-11-19 06:44:59,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:44:59,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286804751] [2022-11-19 06:44:59,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:44:59,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:44:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:44:59,864 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-19 06:44:59,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:44:59,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286804751] [2022-11-19 06:44:59,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286804751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:44:59,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:44:59,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 06:44:59,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668738102] [2022-11-19 06:44:59,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:44:59,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:44:59,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:44:59,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:44:59,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:44:59,914 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 2.0) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-19 06:45:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:00,004 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-11-19 06:45:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:45:00,006 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-19 06:45:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:00,014 INFO L225 Difference]: With dead ends: 34 [2022-11-19 06:45:00,014 INFO L226 Difference]: Without dead ends: 33 [2022-11-19 06:45:00,016 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-19 06:45:00,020 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:00,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 40 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:45:00,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-19 06:45:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-19 06:45:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.875) internal successors, (30), 30 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:45:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-11-19 06:45:00,058 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 2 [2022-11-19 06:45:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:00,059 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-11-19 06:45:00,059 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-19 06:45:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-11-19 06:45:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-19 06:45:00,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:00,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-19 06:45:00,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:45:00,060 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:00,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:00,061 INFO L85 PathProgramCache]: Analyzing trace with hash 3069, now seen corresponding path program 1 times [2022-11-19 06:45:00,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:00,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142564722] [2022-11-19 06:45:00,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:00,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:00,344 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-19 06:45:00,347 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:00,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142564722] [2022-11-19 06:45:00,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142564722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:00,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:45:00,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 06:45:00,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151685344] [2022-11-19 06:45:00,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:00,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:45:00,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:00,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:45:00,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:45:00,356 INFO L87 Difference]: Start difference. First operand 33 states and 34 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-19 06:45:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:00,387 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-11-19 06:45:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:45:00,388 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-19 06:45:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:00,389 INFO L225 Difference]: With dead ends: 32 [2022-11-19 06:45:00,389 INFO L226 Difference]: Without dead ends: 32 [2022-11-19 06:45:00,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:45:00,391 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:00,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:45:00,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-19 06:45:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-19 06:45:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.8125) internal successors, (29), 29 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:45:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-11-19 06:45:00,397 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 2 [2022-11-19 06:45:00,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:00,397 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-11-19 06:45:00,397 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-19 06:45:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-11-19 06:45:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 06:45:00,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:00,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 06:45:00,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 06:45:00,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:00,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:00,402 INFO L85 PathProgramCache]: Analyzing trace with hash 92466461, now seen corresponding path program 1 times [2022-11-19 06:45:00,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:00,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898506565] [2022-11-19 06:45:00,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:00,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:00,719 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-19 06:45:00,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:00,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898506565] [2022-11-19 06:45:00,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898506565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:00,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:45:00,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:45:00,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364714356] [2022-11-19 06:45:00,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:00,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:45:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:00,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:45:00,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:45:00,727 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:00,869 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-11-19 06:45:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:45:00,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-19 06:45:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:00,874 INFO L225 Difference]: With dead ends: 30 [2022-11-19 06:45:00,874 INFO L226 Difference]: Without dead ends: 30 [2022-11-19 06:45:00,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:45:00,876 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:00,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 49 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:45:00,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-19 06:45:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-19 06:45:00,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.6875) internal successors, (27), 27 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 06:45:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-11-19 06:45:00,886 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 5 [2022-11-19 06:45:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:00,887 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-11-19 06:45:00,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-11-19 06:45:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 06:45:00,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:00,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 06:45:00,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 06:45:00,889 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:00,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:00,894 INFO L85 PathProgramCache]: Analyzing trace with hash 92466462, now seen corresponding path program 1 times [2022-11-19 06:45:00,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:00,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553049153] [2022-11-19 06:45:00,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:00,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:01,099 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-19 06:45:01,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:01,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553049153] [2022-11-19 06:45:01,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553049153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:01,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:45:01,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:45:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6916560] [2022-11-19 06:45:01,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:01,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:45:01,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:01,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:45:01,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:45:01,103 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:01,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:01,199 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-11-19 06:45:01,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:45:01,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-19 06:45:01,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:01,200 INFO L225 Difference]: With dead ends: 40 [2022-11-19 06:45:01,201 INFO L226 Difference]: Without dead ends: 40 [2022-11-19 06:45:01,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:45:01,202 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:01,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 69 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:45:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-19 06:45:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-11-19 06:45:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 06:45:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-11-19 06:45:01,210 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 5 [2022-11-19 06:45:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:01,210 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-11-19 06:45:01,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-11-19 06:45:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 06:45:01,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:01,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 06:45:01,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 06:45:01,212 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:01,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1428507031, now seen corresponding path program 1 times [2022-11-19 06:45:01,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:01,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649883452] [2022-11-19 06:45:01,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:01,387 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-19 06:45:01,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:01,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649883452] [2022-11-19 06:45:01,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649883452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:01,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:45:01,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:45:01,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095301735] [2022-11-19 06:45:01,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:01,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:45:01,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:01,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:45:01,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:45:01,392 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:01,479 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-11-19 06:45:01,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:45:01,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-19 06:45:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:01,480 INFO L225 Difference]: With dead ends: 37 [2022-11-19 06:45:01,481 INFO L226 Difference]: Without dead ends: 37 [2022-11-19 06:45:01,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:45:01,482 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:01,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 52 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:45:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-19 06:45:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-19 06:45:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 06:45:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-11-19 06:45:01,495 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 6 [2022-11-19 06:45:01,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:01,496 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-11-19 06:45:01,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-11-19 06:45:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 06:45:01,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:01,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 06:45:01,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 06:45:01,502 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:01,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1428507030, now seen corresponding path program 1 times [2022-11-19 06:45:01,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:01,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183157602] [2022-11-19 06:45:01,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:01,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:01,757 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-19 06:45:01,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:01,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183157602] [2022-11-19 06:45:01,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183157602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:01,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:45:01,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:45:01,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962735292] [2022-11-19 06:45:01,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:01,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:45:01,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:01,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:45:01,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:45:01,761 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:01,882 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-11-19 06:45:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:45:01,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-19 06:45:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:01,885 INFO L225 Difference]: With dead ends: 37 [2022-11-19 06:45:01,885 INFO L226 Difference]: Without dead ends: 37 [2022-11-19 06:45:01,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:45:01,888 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:01,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 65 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:45:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-19 06:45:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-19 06:45:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.5) internal successors, (33), 33 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 06:45:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-11-19 06:45:01,908 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 6 [2022-11-19 06:45:01,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:01,908 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-11-19 06:45:01,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-11-19 06:45:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 06:45:01,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:01,909 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:45:01,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 06:45:01,910 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:01,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:01,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1298482860, now seen corresponding path program 1 times [2022-11-19 06:45:01,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:01,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079758774] [2022-11-19 06:45:01,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:01,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:02,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:02,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079758774] [2022-11-19 06:45:02,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079758774] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:45:02,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655452111] [2022-11-19 06:45:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:02,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:45:02,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:45:02,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:45:02,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 06:45:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:02,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-19 06:45:02,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:45:02,750 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 06:45:02,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-19 06:45:02,854 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 06:45:02,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 06:45:02,922 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 06:45:02,923 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 11 treesize of output 11 [2022-11-19 06:45:03,312 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-19 06:45:03,422 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:45:03,422 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 18 treesize of output 15 [2022-11-19 06:45:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:03,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:45:04,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:45:04,081 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 21 treesize of output 22 [2022-11-19 06:45:04,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:45:04,100 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 33 treesize of output 30 [2022-11-19 06:45:04,110 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 30 treesize of output 26 [2022-11-19 06:45:04,119 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 9 treesize of output 7 [2022-11-19 06:45:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:04,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655452111] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:45:04,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [513614581] [2022-11-19 06:45:04,247 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:45:04,248 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:45:04,252 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 06:45:04,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:45:04,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-11-19 06:45:04,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587126764] [2022-11-19 06:45:04,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:45:04,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-19 06:45:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:04,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-19 06:45:04,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=763, Unknown=3, NotChecked=0, Total=870 [2022-11-19 06:45:04,264 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:04,727 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-11-19 06:45:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-19 06:45:04,728 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 06:45:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:04,730 INFO L225 Difference]: With dead ends: 48 [2022-11-19 06:45:04,730 INFO L226 Difference]: Without dead ends: 48 [2022-11-19 06:45:04,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=141, Invalid=1046, Unknown=3, NotChecked=0, Total=1190 [2022-11-19 06:45:04,731 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:04,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 343 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 172 Invalid, 0 Unknown, 119 Unchecked, 0.2s Time] [2022-11-19 06:45:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-19 06:45:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-11-19 06:45:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 40 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 06:45:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-19 06:45:04,745 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 11 [2022-11-19 06:45:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:04,745 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-19 06:45:04,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-19 06:45:04,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 06:45:04,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:04,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:45:04,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 06:45:04,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:45:04,955 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:04,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:04,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1598263052, now seen corresponding path program 1 times [2022-11-19 06:45:04,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:04,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440949768] [2022-11-19 06:45:04,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:05,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:05,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440949768] [2022-11-19 06:45:05,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440949768] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:45:05,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021474068] [2022-11-19 06:45:05,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:05,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:45:05,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:45:05,584 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:45:05,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 06:45:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:05,668 WARN L261 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-19 06:45:05,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:45:05,687 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 06:45:05,697 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 06:45:05,796 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 06:45:05,796 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 11 treesize of output 11 [2022-11-19 06:45:05,813 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 19 treesize of output 15 [2022-11-19 06:45:05,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 28 [2022-11-19 06:45:06,260 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 22 treesize of output 24 [2022-11-19 06:45:06,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:45:06,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-19 06:45:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:06,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:45:07,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:45:07,358 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 21 treesize of output 22 [2022-11-19 06:45:07,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:45:07,371 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 33 treesize of output 30 [2022-11-19 06:45:07,378 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 9 treesize of output 7 [2022-11-19 06:45:07,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:07,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021474068] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:45:07,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1508340739] [2022-11-19 06:45:07,473 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:45:07,473 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:45:07,473 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 06:45:07,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:45:07,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-19 06:45:07,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155081882] [2022-11-19 06:45:07,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:45:07,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-19 06:45:07,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:07,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-19 06:45:07,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-11-19 06:45:07,476 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:08,270 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-11-19 06:45:08,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 06:45:08,271 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 06:45:08,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:08,272 INFO L225 Difference]: With dead ends: 47 [2022-11-19 06:45:08,272 INFO L226 Difference]: Without dead ends: 47 [2022-11-19 06:45:08,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2022-11-19 06:45:08,273 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:08,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 290 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 81 Unchecked, 0.1s Time] [2022-11-19 06:45:08,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-19 06:45:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-11-19 06:45:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 40 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 06:45:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-11-19 06:45:08,278 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 12 [2022-11-19 06:45:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:08,279 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-11-19 06:45:08,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:08,280 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-11-19 06:45:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 06:45:08,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:08,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:45:08,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 06:45:08,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:45:08,486 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:08,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:08,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1596537156, now seen corresponding path program 1 times [2022-11-19 06:45:08,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:08,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708254783] [2022-11-19 06:45:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:08,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:08,524 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-19 06:45:08,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:08,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708254783] [2022-11-19 06:45:08,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708254783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:08,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:45:08,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:45:08,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974514260] [2022-11-19 06:45:08,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:08,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:45:08,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:08,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:45:08,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:45:08,527 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:08,546 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-11-19 06:45:08,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:45:08,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-19 06:45:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:08,547 INFO L225 Difference]: With dead ends: 44 [2022-11-19 06:45:08,548 INFO L226 Difference]: Without dead ends: 44 [2022-11-19 06:45:08,548 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-19 06:45:08,550 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:08,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 48 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:45:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-19 06:45:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-19 06:45:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 39 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 06:45:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-11-19 06:45:08,560 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 12 [2022-11-19 06:45:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:08,560 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-11-19 06:45:08,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-11-19 06:45:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 06:45:08,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:08,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:45:08,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 06:45:08,562 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2046955788, now seen corresponding path program 1 times [2022-11-19 06:45:08,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:08,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948543625] [2022-11-19 06:45:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:08,614 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-19 06:45:08,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:08,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948543625] [2022-11-19 06:45:08,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948543625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:08,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:45:08,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:45:08,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950420272] [2022-11-19 06:45:08,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:08,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:45:08,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:08,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:45:08,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:45:08,617 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:08,646 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-11-19 06:45:08,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:45:08,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-19 06:45:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:08,647 INFO L225 Difference]: With dead ends: 43 [2022-11-19 06:45:08,648 INFO L226 Difference]: Without dead ends: 43 [2022-11-19 06:45:08,648 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-19 06:45:08,649 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:08,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 41 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:45:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-19 06:45:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-19 06:45:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 38 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 06:45:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-11-19 06:45:08,668 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 13 [2022-11-19 06:45:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:08,668 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-11-19 06:45:08,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-11-19 06:45:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 06:45:08,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:08,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:45:08,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 06:45:08,670 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:08,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:08,671 INFO L85 PathProgramCache]: Analyzing trace with hash -968879938, now seen corresponding path program 1 times [2022-11-19 06:45:08,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:08,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992585514] [2022-11-19 06:45:08,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:08,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:08,754 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-19 06:45:08,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:08,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992585514] [2022-11-19 06:45:08,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992585514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:08,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:45:08,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 06:45:08,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73334346] [2022-11-19 06:45:08,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:08,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:45:08,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:08,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:45:08,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:45:08,757 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:08,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:08,819 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-11-19 06:45:08,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:45:08,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-19 06:45:08,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:08,821 INFO L225 Difference]: With dead ends: 42 [2022-11-19 06:45:08,821 INFO L226 Difference]: Without dead ends: 42 [2022-11-19 06:45:08,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:45:08,822 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:08,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:45:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-19 06:45:08,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-19 06:45:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 37 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 06:45:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-11-19 06:45:08,826 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 14 [2022-11-19 06:45:08,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:08,827 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-11-19 06:45:08,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:08,827 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-11-19 06:45:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 06:45:08,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:08,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:45:08,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 06:45:08,829 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:08,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:08,829 INFO L85 PathProgramCache]: Analyzing trace with hash 29493070, now seen corresponding path program 1 times [2022-11-19 06:45:08,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:08,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876757162] [2022-11-19 06:45:08,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:08,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:08,862 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-19 06:45:08,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:08,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876757162] [2022-11-19 06:45:08,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876757162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:08,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:45:08,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:45:08,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344227801] [2022-11-19 06:45:08,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:08,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:45:08,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:08,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:45:08,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:45:08,865 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:08,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:08,882 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-11-19 06:45:08,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:45:08,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-19 06:45:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:08,883 INFO L225 Difference]: With dead ends: 41 [2022-11-19 06:45:08,884 INFO L226 Difference]: Without dead ends: 41 [2022-11-19 06:45:08,884 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-19 06:45:08,885 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:08,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 44 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:45:08,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-19 06:45:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-19 06:45:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 36 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 06:45:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-11-19 06:45:08,888 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 15 [2022-11-19 06:45:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:08,888 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-11-19 06:45:08,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-11-19 06:45:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 06:45:08,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:08,890 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-19 06:45:08,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 06:45:08,890 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:08,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:08,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1841691382, now seen corresponding path program 2 times [2022-11-19 06:45:08,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:08,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976645220] [2022-11-19 06:45:08,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:08,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:09,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:09,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976645220] [2022-11-19 06:45:09,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976645220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:45:09,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208566841] [2022-11-19 06:45:09,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:45:09,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:45:09,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:45:09,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:45:09,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 06:45:09,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 06:45:09,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:45:09,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-19 06:45:09,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:45:09,913 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 06:45:09,959 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 06:45:09,959 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 11 treesize of output 11 [2022-11-19 06:45:09,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:45:09,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-19 06:45:10,170 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 16 treesize of output 18 [2022-11-19 06:45:10,540 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 24 treesize of output 24 [2022-11-19 06:45:10,638 INFO L321 Elim1Store]: treesize reduction 4, result has 85.2 percent of original size [2022-11-19 06:45:10,638 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 25 treesize of output 33 [2022-11-19 06:45:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:10,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:45:11,812 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_129 (Array Int Int))) (= (select (select (store |c_#memory_int| c_rec_strcopy_helper_~dest.base v_ArrVal_129) c_rec_strcopy_helper_~source.base) c_rec_strcopy_helper_~source.offset) 0)) (forall ((v_rec_strcopy_helper_~source.offset_13 Int) (v_ArrVal_130 (Array Int Int))) (or (<= (+ v_rec_strcopy_helper_~source.offset_13 2) (select |c_#length| c_rec_strcopy_helper_~source.base)) (= (select (select (store |c_#memory_int| c_rec_strcopy_helper_~dest.base v_ArrVal_130) c_rec_strcopy_helper_~source.base) v_rec_strcopy_helper_~source.offset_13) 0) (< (+ c_rec_strcopy_helper_~source.offset 1) v_rec_strcopy_helper_~source.offset_13) (not (<= 0 v_rec_strcopy_helper_~source.offset_13))))) is different from false [2022-11-19 06:45:12,005 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_rec_strcopy_helper_~source.offset_13 Int) (v_ArrVal_130 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_rec_strcopy_~copyAlloc~0#1.base| v_ArrVal_130) |c_ULTIMATE.start_rec_strcopy_~source#1.base|) v_rec_strcopy_helper_~source.offset_13) 0) (< (+ |c_ULTIMATE.start_rec_strcopy_~source#1.offset| 1) v_rec_strcopy_helper_~source.offset_13) (<= (+ v_rec_strcopy_helper_~source.offset_13 2) (select |c_#length| |c_ULTIMATE.start_rec_strcopy_~source#1.base|)) (not (<= 0 v_rec_strcopy_helper_~source.offset_13)))) (forall ((v_ArrVal_129 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_rec_strcopy_~copyAlloc~0#1.base| v_ArrVal_129) |c_ULTIMATE.start_rec_strcopy_~source#1.base|) |c_ULTIMATE.start_rec_strcopy_~source#1.offset|) 0))) is different from false [2022-11-19 06:45:12,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:45:12,042 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 43 treesize of output 32 [2022-11-19 06:45:12,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:45:12,068 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 54 treesize of output 67 [2022-11-19 06:45:12,081 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 30 treesize of output 26 [2022-11-19 06:45:12,091 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 9 treesize of output 7 [2022-11-19 06:45:12,101 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 9 treesize of output 7 [2022-11-19 06:45:12,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-19 06:45:12,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208566841] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:45:12,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1788290031] [2022-11-19 06:45:12,285 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:45:12,285 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:45:12,285 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 06:45:12,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:45:12,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 41 [2022-11-19 06:45:12,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435907653] [2022-11-19 06:45:12,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:45:12,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-19 06:45:12,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:12,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-19 06:45:12,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1474, Unknown=8, NotChecked=158, Total=1806 [2022-11-19 06:45:12,287 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:16,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:16,808 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-11-19 06:45:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-19 06:45:16,809 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 06:45:16,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:16,810 INFO L225 Difference]: With dead ends: 52 [2022-11-19 06:45:16,810 INFO L226 Difference]: Without dead ends: 52 [2022-11-19 06:45:16,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=281, Invalid=2468, Unknown=15, NotChecked=206, Total=2970 [2022-11-19 06:45:16,812 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:16,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 282 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 205 Unchecked, 0.1s Time] [2022-11-19 06:45:16,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-19 06:45:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-11-19 06:45:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 43 states have internal predecessors, (47), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-19 06:45:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-11-19 06:45:16,817 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 17 [2022-11-19 06:45:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:16,817 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-11-19 06:45:16,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-11-19 06:45:16,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 06:45:16,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:16,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:45:16,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 06:45:17,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:45:17,024 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:17,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:17,024 INFO L85 PathProgramCache]: Analyzing trace with hash 914285248, now seen corresponding path program 1 times [2022-11-19 06:45:17,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:17,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408849823] [2022-11-19 06:45:17,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:17,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:17,077 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-19 06:45:17,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:17,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408849823] [2022-11-19 06:45:17,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408849823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:17,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:45:17,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:45:17,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892529600] [2022-11-19 06:45:17,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:17,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:45:17,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:17,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:45:17,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:45:17,079 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:17,109 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-11-19 06:45:17,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:45:17,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-19 06:45:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:17,110 INFO L225 Difference]: With dead ends: 50 [2022-11-19 06:45:17,110 INFO L226 Difference]: Without dead ends: 50 [2022-11-19 06:45:17,111 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-19 06:45:17,111 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 39 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-19 06:45:17,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 39 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:45:17,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-19 06:45:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-19 06:45:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 42 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-19 06:45:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-11-19 06:45:17,115 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 16 [2022-11-19 06:45:17,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:17,115 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-11-19 06:45:17,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-11-19 06:45:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 06:45:17,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:17,117 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-19 06:45:17,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 06:45:17,117 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:17,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1257858050, now seen corresponding path program 2 times [2022-11-19 06:45:17,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:17,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751849540] [2022-11-19 06:45:17,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:17,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:17,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:17,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751849540] [2022-11-19 06:45:17,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751849540] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:45:17,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890059469] [2022-11-19 06:45:17,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:45:17,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:45:17,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:45:17,914 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:45:17,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 06:45:18,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 06:45:18,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:45:18,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-19 06:45:18,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:45:18,018 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 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-19 06:45:18,074 INFO L321 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2022-11-19 06:45:18,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2022-11-19 06:45:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:18,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:45:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:19,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890059469] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:45:19,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2020166732] [2022-11-19 06:45:19,618 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:45:19,618 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:45:19,618 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 06:45:19,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:45:19,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-19 06:45:19,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165906299] [2022-11-19 06:45:19,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:45:19,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-19 06:45:19,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:19,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-19 06:45:19,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2022-11-19 06:45:19,621 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 32 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 22 states have internal predecessors, (45), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:22,765 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-11-19 06:45:22,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-19 06:45:22,766 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 22 states have internal predecessors, (45), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-19 06:45:22,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:22,767 INFO L225 Difference]: With dead ends: 104 [2022-11-19 06:45:22,767 INFO L226 Difference]: Without dead ends: 104 [2022-11-19 06:45:22,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=512, Invalid=2794, Unknown=0, NotChecked=0, Total=3306 [2022-11-19 06:45:22,769 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 477 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:22,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 301 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 459 Invalid, 0 Unknown, 78 Unchecked, 0.7s Time] [2022-11-19 06:45:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-19 06:45:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 88. [2022-11-19 06:45:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.359375) internal successors, (87), 77 states have internal predecessors, (87), 10 states have call successors, (10), 9 states have call predecessors, (10), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-19 06:45:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-11-19 06:45:22,777 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 18 [2022-11-19 06:45:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:22,777 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-11-19 06:45:22,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 22 states have internal predecessors, (45), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-11-19 06:45:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 06:45:22,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:22,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:45:22,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 06:45:22,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 06:45:22,984 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:22,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:22,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1721928304, now seen corresponding path program 1 times [2022-11-19 06:45:22,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:22,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307149888] [2022-11-19 06:45:22,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:22,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:23,084 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-19 06:45:23,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:23,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307149888] [2022-11-19 06:45:23,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307149888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:23,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:45:23,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:45:23,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151431382] [2022-11-19 06:45:23,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:23,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:45:23,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:23,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:45:23,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:45:23,087 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:23,137 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2022-11-19 06:45:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:45:23,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-19 06:45:23,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:23,138 INFO L225 Difference]: With dead ends: 87 [2022-11-19 06:45:23,139 INFO L226 Difference]: Without dead ends: 87 [2022-11-19 06:45:23,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:45:23,139 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:23,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 43 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:45:23,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-19 06:45:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-11-19 06:45:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.34375) internal successors, (86), 76 states have internal predecessors, (86), 10 states have call successors, (10), 9 states have call predecessors, (10), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-19 06:45:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2022-11-19 06:45:23,143 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 17 [2022-11-19 06:45:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:23,144 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2022-11-19 06:45:23,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2022-11-19 06:45:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 06:45:23,144 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:23,144 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2022-11-19 06:45:23,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 06:45:23,145 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting rec_strcopy_helperErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:23,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash -338892171, now seen corresponding path program 1 times [2022-11-19 06:45:23,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:23,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319324903] [2022-11-19 06:45:23,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:23,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-19 06:45:23,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:23,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319324903] [2022-11-19 06:45:23,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319324903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:23,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:45:23,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:45:23,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745246056] [2022-11-19 06:45:23,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:23,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:45:23,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:23,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:45:23,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:45:23,184 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:23,211 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-11-19 06:45:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:45:23,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 06:45:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:23,213 INFO L225 Difference]: With dead ends: 86 [2022-11-19 06:45:23,213 INFO L226 Difference]: Without dead ends: 86 [2022-11-19 06:45:23,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:45:23,214 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 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-19 06:45:23,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:45:23,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-19 06:45:23,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-19 06:45:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.234375) internal successors, (79), 75 states have internal predecessors, (79), 10 states have call successors, (10), 9 states have call predecessors, (10), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-19 06:45:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2022-11-19 06:45:23,218 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 19 [2022-11-19 06:45:23,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:23,218 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2022-11-19 06:45:23,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-11-19 06:45:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 06:45:23,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:23,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:45:23,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 06:45:23,220 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:23,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1840169789, now seen corresponding path program 1 times [2022-11-19 06:45:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:23,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744885812] [2022-11-19 06:45:23,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:23,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:23,384 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-19 06:45:23,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:23,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744885812] [2022-11-19 06:45:23,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744885812] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:45:23,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:45:23,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 06:45:23,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072480426] [2022-11-19 06:45:23,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:45:23,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:45:23,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:23,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:45:23,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:45:23,387 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:23,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:23,545 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-11-19 06:45:23,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 06:45:23,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-19 06:45:23,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:23,546 INFO L225 Difference]: With dead ends: 85 [2022-11-19 06:45:23,546 INFO L226 Difference]: Without dead ends: 59 [2022-11-19 06:45:23,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-19 06:45:23,547 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:23,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:45:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-19 06:45:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-11-19 06:45:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-11-19 06:45:23,550 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 18 [2022-11-19 06:45:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:23,551 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-11-19 06:45:23,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 06:45:23,551 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-11-19 06:45:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-19 06:45:23,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:23,552 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2022-11-19 06:45:23,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-19 06:45:23,552 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:23,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1792056054, now seen corresponding path program 3 times [2022-11-19 06:45:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:23,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887267856] [2022-11-19 06:45:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:25,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:25,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887267856] [2022-11-19 06:45:25,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887267856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:45:25,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702419087] [2022-11-19 06:45:25,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 06:45:25,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:45:25,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:45:25,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:45:25,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 06:45:25,281 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 06:45:25,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:45:25,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-19 06:45:25,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:45:25,294 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 06:45:25,298 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 06:45:25,357 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-19 06:45:25,380 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 06:45:25,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-19 06:45:25,448 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 06:45:25,449 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 11 treesize of output 11 [2022-11-19 06:45:25,830 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-19 06:45:26,352 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 27 treesize of output 27 [2022-11-19 06:45:26,981 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 37 treesize of output 35 [2022-11-19 06:45:27,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2022-11-19 06:45:27,886 INFO L321 Elim1Store]: treesize reduction 12, result has 73.3 percent of original size [2022-11-19 06:45:27,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 51 [2022-11-19 06:45:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:28,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:45:29,246 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_228 (Array Int Int))) (= (select (select (store |c_#memory_int| c_rec_strcopy_helper_~dest.base v_ArrVal_228) c_rec_strcopy_helper_~source.base) c_rec_strcopy_helper_~source.offset) 0)) (and (<= (+ c_rec_strcopy_helper_~source.offset 3) (select |c_#length| c_rec_strcopy_helper_~source.base)) (<= 0 (+ c_rec_strcopy_helper_~source.offset 2))) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#memory_int| c_rec_strcopy_helper_~dest.base v_ArrVal_229) c_rec_strcopy_helper_~source.base) (+ c_rec_strcopy_helper_~source.offset 1)) 0))) is different from false [2022-11-19 06:45:29,427 WARN L837 $PredicateComparison]: unable to prove that (or (and (<= (+ c_rec_strcopy_helper_~source.offset 4) (select |c_#length| c_rec_strcopy_helper_~source.base)) (<= 0 (+ c_rec_strcopy_helper_~source.offset 3))) (forall ((v_ArrVal_228 (Array Int Int))) (= (select (select (store |c_#memory_int| c_rec_strcopy_helper_~dest.base v_ArrVal_228) c_rec_strcopy_helper_~source.base) (+ c_rec_strcopy_helper_~source.offset 1)) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#memory_int| c_rec_strcopy_helper_~dest.base v_ArrVal_229) c_rec_strcopy_helper_~source.base) (+ c_rec_strcopy_helper_~source.offset 2)) 0))) is different from false [2022-11-19 06:45:29,955 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_rec_strcopy_helper_#in~dest.base| v_ArrVal_229) |c_rec_strcopy_helper_#in~source.base|) (+ 2 |c_rec_strcopy_helper_#in~source.offset|)) 0)) (and (<= 0 (+ 3 |c_rec_strcopy_helper_#in~source.offset|)) (<= (+ 4 |c_rec_strcopy_helper_#in~source.offset|) (select |c_#length| |c_rec_strcopy_helper_#in~source.base|))) (forall ((v_ArrVal_228 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_rec_strcopy_helper_#in~dest.base| v_ArrVal_228) |c_rec_strcopy_helper_#in~source.base|) (+ 1 |c_rec_strcopy_helper_#in~source.offset|)) 0)) (forall ((v_ArrVal_227 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_rec_strcopy_helper_#in~dest.base| v_ArrVal_227) |c_rec_strcopy_helper_#in~source.base|) |c_rec_strcopy_helper_#in~source.offset|) 0))) is different from false [2022-11-19 06:45:31,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:45:31,536 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 91 treesize of output 58 [2022-11-19 06:45:31,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:45:31,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 127 [2022-11-19 06:45:31,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 06:45:31,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 06:45:31,625 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 9 treesize of output 7 [2022-11-19 06:45:31,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 06:45:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-11-19 06:45:32,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702419087] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:45:32,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1127565448] [2022-11-19 06:45:32,171 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:45:32,171 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:45:32,172 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 06:45:32,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:45:32,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 25] total 62 [2022-11-19 06:45:32,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424068616] [2022-11-19 06:45:32,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:45:32,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-19 06:45:32,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:32,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-19 06:45:32,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=3294, Unknown=58, NotChecked=360, Total=4032 [2022-11-19 06:45:32,175 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 64 states, 51 states have (on average 1.411764705882353) internal successors, (72), 48 states have internal predecessors, (72), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:43,656 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-11-19 06:45:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-19 06:45:43,657 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 51 states have (on average 1.411764705882353) internal successors, (72), 48 states have internal predecessors, (72), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-19 06:45:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:43,657 INFO L225 Difference]: With dead ends: 55 [2022-11-19 06:45:43,658 INFO L226 Difference]: Without dead ends: 55 [2022-11-19 06:45:43,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 2130 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=891, Invalid=9141, Unknown=80, NotChecked=600, Total=10712 [2022-11-19 06:45:43,662 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:43,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 279 Unchecked, 0.1s Time] [2022-11-19 06:45:43,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-19 06:45:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-19 06:45:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-11-19 06:45:43,665 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 29 [2022-11-19 06:45:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:43,665 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-11-19 06:45:43,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 51 states have (on average 1.411764705882353) internal successors, (72), 48 states have internal predecessors, (72), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-11-19 06:45:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 06:45:43,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:45:43,667 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1] [2022-11-19 06:45:43,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 06:45:43,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:45:43,880 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-11-19 06:45:43,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:45:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1759520582, now seen corresponding path program 3 times [2022-11-19 06:45:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:45:43,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774065717] [2022-11-19 06:45:43,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:45:43,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:45:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:45:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 140 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:45,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:45:45,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774065717] [2022-11-19 06:45:45,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774065717] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:45:45,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198149513] [2022-11-19 06:45:45,783 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 06:45:45,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:45:45,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:45:45,787 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:45:45,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 06:45:46,024 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 06:45:46,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:45:46,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 161 conjunts are in the unsatisfiable core [2022-11-19 06:45:46,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:45:46,048 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 06:45:46,054 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 06:45:46,137 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 06:45:46,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-11-19 06:45:46,162 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 06:45:46,163 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 11 treesize of output 11 [2022-11-19 06:45:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:48,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:45:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:45:50,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198149513] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:45:50,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1438688131] [2022-11-19 06:45:50,225 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-19 06:45:50,225 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:45:50,226 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 06:45:50,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:45:50,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 64 [2022-11-19 06:45:50,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94603141] [2022-11-19 06:45:50,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:45:50,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-19 06:45:50,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:45:50,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-19 06:45:50,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=3825, Unknown=0, NotChecked=0, Total=4290 [2022-11-19 06:45:50,229 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 66 states, 62 states have (on average 2.1774193548387095) internal successors, (135), 38 states have internal predecessors, (135), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:45:52,660 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-11-19 06:45:52,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-19 06:45:52,661 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 2.1774193548387095) internal successors, (135), 38 states have internal predecessors, (135), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-19 06:45:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:45:52,661 INFO L225 Difference]: With dead ends: 60 [2022-11-19 06:45:52,661 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 06:45:52,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1142, Invalid=6690, Unknown=0, NotChecked=0, Total=7832 [2022-11-19 06:45:52,664 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 333 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-19 06:45:52,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 223 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1002 Invalid, 0 Unknown, 94 Unchecked, 0.9s Time] [2022-11-19 06:45:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 06:45:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 06:45:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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-19 06:45:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 06:45:52,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2022-11-19 06:45:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:45:52,665 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 06:45:52,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 2.1774193548387095) internal successors, (135), 38 states have internal predecessors, (135), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:45:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 06:45:52,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 06:45:52,668 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2022-11-19 06:45:52,668 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2022-11-19 06:45:52,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2022-11-19 06:45:52,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2022-11-19 06:45:52,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2022-11-19 06:45:52,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2022-11-19 06:45:52,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2022-11-19 06:45:52,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2022-11-19 06:45:52,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (6 of 15 remaining) [2022-11-19 06:45:52,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (5 of 15 remaining) [2022-11-19 06:45:52,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (4 of 15 remaining) [2022-11-19 06:45:52,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (3 of 15 remaining) [2022-11-19 06:45:52,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (2 of 15 remaining) [2022-11-19 06:45:52,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (1 of 15 remaining) [2022-11-19 06:45:52,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2022-11-19 06:45:52,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 06:45:52,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:45:52,879 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:45:52,881 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 06:45:52,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:45:52 BoogieIcfgContainer [2022-11-19 06:45:52,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 06:45:52,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 06:45:52,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 06:45:52,884 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 06:45:52,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:44:59" (3/4) ... [2022-11-19 06:45:52,888 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 06:45:52,893 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rec_strcopy_helper [2022-11-19 06:45:52,900 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-19 06:45:52,900 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-19 06:45:52,900 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-19 06:45:52,901 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 06:45:52,936 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 06:45:52,936 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 06:45:52,937 INFO L158 Benchmark]: Toolchain (without parser) took 54302.77ms. Allocated memory was 134.2MB in the beginning and 255.9MB in the end (delta: 121.6MB). Free memory was 97.4MB in the beginning and 94.8MB in the end (delta: 2.5MB). Peak memory consumption was 124.6MB. Max. memory is 16.1GB. [2022-11-19 06:45:52,937 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 134.2MB. Free memory was 104.7MB in the beginning and 104.7MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:45:52,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.08ms. Allocated memory is still 134.2MB. Free memory was 97.1MB in the beginning and 108.6MB in the end (delta: -11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 06:45:52,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.44ms. Allocated memory is still 134.2MB. Free memory was 108.6MB in the beginning and 107.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:45:52,943 INFO L158 Benchmark]: Boogie Preprocessor took 24.98ms. Allocated memory is still 134.2MB. Free memory was 107.3MB in the beginning and 106.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:45:52,943 INFO L158 Benchmark]: RCFGBuilder took 560.41ms. Allocated memory is still 134.2MB. Free memory was 106.0MB in the beginning and 90.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-19 06:45:52,944 INFO L158 Benchmark]: TraceAbstraction took 53364.26ms. Allocated memory was 134.2MB in the beginning and 255.9MB in the end (delta: 121.6MB). Free memory was 89.9MB in the beginning and 98.0MB in the end (delta: -8.1MB). Peak memory consumption was 114.9MB. Max. memory is 16.1GB. [2022-11-19 06:45:52,944 INFO L158 Benchmark]: Witness Printer took 52.64ms. Allocated memory is still 255.9MB. Free memory was 98.0MB in the beginning and 94.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 06:45:52,950 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 134.2MB. Free memory was 104.7MB in the beginning and 104.7MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.08ms. Allocated memory is still 134.2MB. Free memory was 97.1MB in the beginning and 108.6MB in the end (delta: -11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.44ms. Allocated memory is still 134.2MB. Free memory was 108.6MB in the beginning and 107.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.98ms. Allocated memory is still 134.2MB. Free memory was 107.3MB in the beginning and 106.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 560.41ms. Allocated memory is still 134.2MB. Free memory was 106.0MB in the beginning and 90.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 53364.26ms. Allocated memory was 134.2MB in the beginning and 255.9MB in the end (delta: 121.6MB). Free memory was 89.9MB in the beginning and 98.0MB in the end (delta: -8.1MB). Peak memory consumption was 114.9MB. Max. memory is 16.1GB. * Witness Printer took 52.64ms. Allocated memory is still 255.9MB. Free memory was 98.0MB in the beginning and 94.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 44]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 44]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 44]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 33]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 53.3s, OverallIterations: 20, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1165 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1159 mSDsluCounter, 2094 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 856 IncrementalHoareTripleChecker+Unchecked, 1703 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2352 IncrementalHoareTripleChecker+Invalid, 3410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 391 mSDtfsCounter, 2352 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 552 GetRequests, 122 SyntacticMatches, 8 SemanticMatches, 422 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 5348 ImplicationChecksByTransitivity, 34.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=15, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 27 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 26.3s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 541 ConstructedInterpolants, 94 QuantifiedInterpolants, 11752 SizeOfPredicates, 182 NumberOfNonLiveVariables, 1248 ConjunctsInSsa, 554 ConjunctsInUnsatCore, 32 InterpolantComputations, 14 PerfectInterpolantSequences, 155/803 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-19 06:45:52,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4368e1c1-b19c-4629-8732-5620e8667705/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE