./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 10:37:17,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 10:37:17,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 10:37:17,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 10:37:17,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 10:37:17,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 10:37:17,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 10:37:17,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 10:37:17,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 10:37:17,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 10:37:17,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 10:37:17,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 10:37:17,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 10:37:17,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 10:37:17,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 10:37:17,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 10:37:17,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 10:37:17,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 10:37:17,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 10:37:17,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 10:37:17,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 10:37:17,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 10:37:17,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 10:37:17,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 10:37:17,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 10:37:17,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 10:37:17,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 10:37:17,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 10:37:17,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 10:37:17,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 10:37:17,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 10:37:17,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 10:37:17,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 10:37:17,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 10:37:17,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 10:37:17,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 10:37:17,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 10:37:17,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 10:37:17,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 10:37:17,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 10:37:17,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 10:37:17,866 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-12-14 10:37:17,882 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 10:37:17,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 10:37:17,882 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 10:37:17,882 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 10:37:17,883 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 10:37:17,883 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 10:37:17,883 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 10:37:17,883 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 10:37:17,883 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 10:37:17,883 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 10:37:17,883 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 10:37:17,883 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 10:37:17,884 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 10:37:17,884 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 10:37:17,884 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 10:37:17,884 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 10:37:17,884 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 10:37:17,884 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 10:37:17,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 10:37:17,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 10:37:17,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 10:37:17,885 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 10:37:17,885 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 10:37:17,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 10:37:17,885 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 10:37:17,885 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 10:37:17,886 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 10:37:17,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 10:37:17,886 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 10:37:17,886 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 10:37:17,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 10:37:17,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 10:37:17,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:37:17,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 10:37:17,886 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 10:37:17,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 10:37:17,887 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 10:37:17,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 10:37:17,887 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 10:37:17,887 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_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f561bb39ee57b07ab3831dd4ee3a1e439959bee7f69e1cabc2315100876031b [2022-12-14 10:37:18,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 10:37:18,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 10:37:18,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 10:37:18,078 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 10:37:18,078 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 10:37:18,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2022-12-14 10:37:20,735 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 10:37:20,914 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 10:37:20,915 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/sv-benchmarks/c/termination-memory-alloca/b.10-alloca.i [2022-12-14 10:37:20,926 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/data/762496924/c1d846a3b5ba495ab1bd66886eb515a6/FLAG9a9174d4e [2022-12-14 10:37:20,936 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/data/762496924/c1d846a3b5ba495ab1bd66886eb515a6 [2022-12-14 10:37:20,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 10:37:20,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 10:37:20,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 10:37:20,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 10:37:20,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 10:37:20,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:37:20" (1/1) ... [2022-12-14 10:37:20,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642a05bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:20, skipping insertion in model container [2022-12-14 10:37:20,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:37:20" (1/1) ... [2022-12-14 10:37:20,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 10:37:20,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 10:37:21,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:37:21,162 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 10:37:21,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:37:21,200 INFO L208 MainTranslator]: Completed translation [2022-12-14 10:37:21,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:21 WrapperNode [2022-12-14 10:37:21,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 10:37:21,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 10:37:21,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 10:37:21,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 10:37:21,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:21" (1/1) ... [2022-12-14 10:37:21,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:21" (1/1) ... [2022-12-14 10:37:21,228 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2022-12-14 10:37:21,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 10:37:21,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 10:37:21,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 10:37:21,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 10:37:21,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:21" (1/1) ... [2022-12-14 10:37:21,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:21" (1/1) ... [2022-12-14 10:37:21,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:21" (1/1) ... [2022-12-14 10:37:21,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:21" (1/1) ... [2022-12-14 10:37:21,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:21" (1/1) ... [2022-12-14 10:37:21,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:21" (1/1) ... [2022-12-14 10:37:21,244 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:21" (1/1) ... [2022-12-14 10:37:21,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:21" (1/1) ... [2022-12-14 10:37:21,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 10:37:21,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 10:37:21,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 10:37:21,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 10:37:21,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:21" (1/1) ... [2022-12-14 10:37:21,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:37:21,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:37:21,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 10:37:21,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 10:37:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 10:37:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 10:37:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 10:37:21,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 10:37:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 10:37:21,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 10:37:21,383 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 10:37:21,385 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 10:37:21,600 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 10:37:21,641 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 10:37:21,641 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 10:37:21,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:37:21 BoogieIcfgContainer [2022-12-14 10:37:21,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 10:37:21,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 10:37:21,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 10:37:21,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 10:37:21,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:37:20" (1/3) ... [2022-12-14 10:37:21,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:37:21, skipping insertion in model container [2022-12-14 10:37:21,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:37:21" (2/3) ... [2022-12-14 10:37:21,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:37:21, skipping insertion in model container [2022-12-14 10:37:21,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:37:21" (3/3) ... [2022-12-14 10:37:21,654 INFO L112 eAbstractionObserver]: Analyzing ICFG b.10-alloca.i [2022-12-14 10:37:21,670 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 10:37:21,670 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-12-14 10:37:21,709 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 10:37:21,715 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;@104adfb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 10:37:21,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-12-14 10:37:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 30 states have (on average 2.5) internal successors, (75), 67 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:21,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 10:37:21,724 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:37:21,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 10:37:21,725 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-12-14 10:37:21,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:37:21,730 INFO L85 PathProgramCache]: Analyzing trace with hash 4995, now seen corresponding path program 1 times [2022-12-14 10:37:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:37:21,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917934941] [2022-12-14 10:37:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:37:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:37:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:37:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:37:22,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:37:22,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917934941] [2022-12-14 10:37:22,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917934941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:37:22,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:37:22,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:37:22,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254130007] [2022-12-14 10:37:22,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:37:22,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:37:22,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:37:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:37:22,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:37:22,059 INFO L87 Difference]: Start difference. First operand has 68 states, 30 states have (on average 2.5) internal successors, (75), 67 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:37:22,132 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-12-14 10:37:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:37:22,135 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-12-14 10:37:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:37:22,141 INFO L225 Difference]: With dead ends: 59 [2022-12-14 10:37:22,141 INFO L226 Difference]: Without dead ends: 58 [2022-12-14 10:37:22,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:37:22,144 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:37:22,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 27 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:37:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-14 10:37:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-12-14 10:37:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 57 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-12-14 10:37:22,169 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 2 [2022-12-14 10:37:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:37:22,169 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-12-14 10:37:22,169 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-12-14 10:37:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-12-14 10:37:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 10:37:22,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:37:22,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 10:37:22,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 10:37:22,170 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-12-14 10:37:22,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:37:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash 4996, now seen corresponding path program 1 times [2022-12-14 10:37:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:37:22,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84066279] [2022-12-14 10:37:22,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:37:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:37:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:37:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:37:22,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:37:22,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84066279] [2022-12-14 10:37:22,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84066279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:37:22,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:37:22,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:37:22,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740942184] [2022-12-14 10:37:22,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:37:22,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:37:22,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:37:22,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:37:22,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:37:22,321 INFO L87 Difference]: Start difference. First operand 58 states and 64 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-12-14 10:37:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:37:22,369 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-12-14 10:37:22,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:37:22,370 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-12-14 10:37:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:37:22,371 INFO L225 Difference]: With dead ends: 49 [2022-12-14 10:37:22,371 INFO L226 Difference]: Without dead ends: 49 [2022-12-14 10:37:22,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:37:22,372 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:37:22,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 27 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:37:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-14 10:37:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-12-14 10:37:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-12-14 10:37:22,376 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 2 [2022-12-14 10:37:22,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:37:22,376 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-12-14 10:37:22,376 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-12-14 10:37:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-12-14 10:37:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 10:37:22,376 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:37:22,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 10:37:22,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 10:37:22,377 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-12-14 10:37:22,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:37:22,377 INFO L85 PathProgramCache]: Analyzing trace with hash 154821, now seen corresponding path program 1 times [2022-12-14 10:37:22,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:37:22,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3102376] [2022-12-14 10:37:22,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:37:22,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:37:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:37:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:37:22,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:37:22,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3102376] [2022-12-14 10:37:22,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3102376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:37:22,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:37:22,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:37:22,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540445316] [2022-12-14 10:37:22,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:37:22,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:37:22,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:37:22,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:37:22,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:37:22,445 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:37:22,488 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-12-14 10:37:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:37:22,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 10:37:22,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:37:22,489 INFO L225 Difference]: With dead ends: 42 [2022-12-14 10:37:22,489 INFO L226 Difference]: Without dead ends: 42 [2022-12-14 10:37:22,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:37:22,491 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:37:22,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 20 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:37:22,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-14 10:37:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-12-14 10:37:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.6) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-12-14 10:37:22,496 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 3 [2022-12-14 10:37:22,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:37:22,496 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-12-14 10:37:22,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-12-14 10:37:22,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 10:37:22,497 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:37:22,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 10:37:22,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 10:37:22,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-12-14 10:37:22,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:37:22,497 INFO L85 PathProgramCache]: Analyzing trace with hash 154822, now seen corresponding path program 1 times [2022-12-14 10:37:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:37:22,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081619933] [2022-12-14 10:37:22,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:37:22,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:37:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:37:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:37:22,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:37:22,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081619933] [2022-12-14 10:37:22,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081619933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:37:22,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:37:22,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:37:22,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104875251] [2022-12-14 10:37:22,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:37:22,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:37:22,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:37:22,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:37:22,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:37:22,550 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:37:22,594 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-12-14 10:37:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:37:22,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 10:37:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:37:22,596 INFO L225 Difference]: With dead ends: 35 [2022-12-14 10:37:22,596 INFO L226 Difference]: Without dead ends: 35 [2022-12-14 10:37:22,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:37:22,597 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:37:22,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 20 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:37:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-12-14 10:37:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-12-14 10:37:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-12-14 10:37:22,601 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 3 [2022-12-14 10:37:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:37:22,602 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-12-14 10:37:22,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-12-14 10:37:22,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 10:37:22,603 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:37:22,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 10:37:22,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 10:37:22,603 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-12-14 10:37:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:37:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash 4799430, now seen corresponding path program 1 times [2022-12-14 10:37:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:37:22,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342490667] [2022-12-14 10:37:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:37:22,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:37:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:37:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:37:22,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:37:22,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342490667] [2022-12-14 10:37:22,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342490667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:37:22,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:37:22,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:37:22,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627472745] [2022-12-14 10:37:22,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:37:22,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:37:22,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:37:22,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:37:22,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:37:22,642 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:37:22,671 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-12-14 10:37:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:37:22,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 10:37:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:37:22,672 INFO L225 Difference]: With dead ends: 33 [2022-12-14 10:37:22,672 INFO L226 Difference]: Without dead ends: 33 [2022-12-14 10:37:22,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:37:22,674 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:37:22,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 18 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:37:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-12-14 10:37:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-12-14 10:37:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-12-14 10:37:22,677 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 4 [2022-12-14 10:37:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:37:22,677 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-12-14 10:37:22,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-12-14 10:37:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 10:37:22,678 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:37:22,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 10:37:22,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 10:37:22,679 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-12-14 10:37:22,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:37:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash 4799431, now seen corresponding path program 1 times [2022-12-14 10:37:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:37:22,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983142735] [2022-12-14 10:37:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:37:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:37:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:37:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:37:22,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:37:22,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983142735] [2022-12-14 10:37:22,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983142735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:37:22,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:37:22,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:37:22,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848979256] [2022-12-14 10:37:22,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:37:22,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:37:22,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:37:22,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:37:22,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:37:22,737 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:37:22,761 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-12-14 10:37:22,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:37:22,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 10:37:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:37:22,762 INFO L225 Difference]: With dead ends: 31 [2022-12-14 10:37:22,762 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 10:37:22,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:37:22,763 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:37:22,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:37:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 10:37:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-12-14 10:37:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-12-14 10:37:22,767 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 4 [2022-12-14 10:37:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:37:22,767 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-12-14 10:37:22,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-12-14 10:37:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:37:22,768 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:37:22,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:37:22,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 10:37:22,769 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-12-14 10:37:22,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:37:22,769 INFO L85 PathProgramCache]: Analyzing trace with hash 251747111, now seen corresponding path program 1 times [2022-12-14 10:37:22,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:37:22,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804170929] [2022-12-14 10:37:22,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:37:22,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:37:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:37:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:37:22,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:37:22,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804170929] [2022-12-14 10:37:22,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804170929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:37:22,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:37:22,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:37:22,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885424668] [2022-12-14 10:37:22,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:37:22,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:37:22,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:37:22,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:37:22,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:37:22,809 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:37:22,846 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-12-14 10:37:22,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:37:22,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 10:37:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:37:22,847 INFO L225 Difference]: With dead ends: 43 [2022-12-14 10:37:22,847 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 10:37:22,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:37:22,848 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:37:22,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 76 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:37:22,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 10:37:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-12-14 10:37:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-12-14 10:37:22,852 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 13 [2022-12-14 10:37:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:37:22,853 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-12-14 10:37:22,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-12-14 10:37:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 10:37:22,853 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:37:22,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:37:22,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 10:37:22,854 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-12-14 10:37:22,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:37:22,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2053333768, now seen corresponding path program 1 times [2022-12-14 10:37:22,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:37:22,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847091145] [2022-12-14 10:37:22,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:37:22,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:37:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:37:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:37:22,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:37:22,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847091145] [2022-12-14 10:37:22,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847091145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:37:22,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:37:22,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:37:22,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372308261] [2022-12-14 10:37:22,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:37:22,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:37:22,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:37:22,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:37:22,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:37:22,894 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:37:22,926 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-12-14 10:37:22,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:37:22,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 10:37:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:37:22,926 INFO L225 Difference]: With dead ends: 38 [2022-12-14 10:37:22,927 INFO L226 Difference]: Without dead ends: 38 [2022-12-14 10:37:22,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:37:22,928 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:37:22,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 71 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:37:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-14 10:37:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-12-14 10:37:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-12-14 10:37:22,931 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 15 [2022-12-14 10:37:22,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:37:22,931 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-12-14 10:37:22,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-12-14 10:37:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 10:37:22,932 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:37:22,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:37:22,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 10:37:22,933 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-12-14 10:37:22,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:37:22,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1990805606, now seen corresponding path program 1 times [2022-12-14 10:37:22,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:37:22,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634844889] [2022-12-14 10:37:22,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:37:22,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:37:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:37:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:37:23,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:37:23,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634844889] [2022-12-14 10:37:23,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634844889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:37:23,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:37:23,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:37:23,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150965341] [2022-12-14 10:37:23,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:37:23,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:37:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:37:23,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:37:23,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:37:23,017 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:37:23,086 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-12-14 10:37:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:37:23,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 10:37:23,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:37:23,087 INFO L225 Difference]: With dead ends: 64 [2022-12-14 10:37:23,087 INFO L226 Difference]: Without dead ends: 64 [2022-12-14 10:37:23,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:37:23,088 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:37:23,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 80 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:37:23,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-14 10:37:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-12-14 10:37:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2022-12-14 10:37:23,093 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 16 [2022-12-14 10:37:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:37:23,094 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2022-12-14 10:37:23,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-12-14 10:37:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 10:37:23,095 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:37:23,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:37:23,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 10:37:23,095 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-12-14 10:37:23,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:37:23,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1594830451, now seen corresponding path program 1 times [2022-12-14 10:37:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:37:23,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601830397] [2022-12-14 10:37:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:37:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:37:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:37:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:37:23,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:37:23,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601830397] [2022-12-14 10:37:23,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601830397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:37:23,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:37:23,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:37:23,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055699547] [2022-12-14 10:37:23,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:37:23,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:37:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:37:23,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:37:23,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:37:23,320 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:37:23,354 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-12-14 10:37:23,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:37:23,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 10:37:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:37:23,355 INFO L225 Difference]: With dead ends: 56 [2022-12-14 10:37:23,355 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 10:37:23,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:37:23,356 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:37:23,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:37:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 10:37:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 10:37:23,357 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-12-14 10:37:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 10:37:23,357 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-12-14 10:37:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:37:23,357 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 10:37:23,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:37:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 10:37:23,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 10:37:23,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 37 remaining) [2022-12-14 10:37:23,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 37 remaining) [2022-12-14 10:37:23,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 37 remaining) [2022-12-14 10:37:23,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 37 remaining) [2022-12-14 10:37:23,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 37 remaining) [2022-12-14 10:37:23,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 37 remaining) [2022-12-14 10:37:23,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 37 remaining) [2022-12-14 10:37:23,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 37 remaining) [2022-12-14 10:37:23,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 37 remaining) [2022-12-14 10:37:23,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 37 remaining) [2022-12-14 10:37:23,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 37 remaining) [2022-12-14 10:37:23,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 37 remaining) [2022-12-14 10:37:23,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 37 remaining) [2022-12-14 10:37:23,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 37 remaining) [2022-12-14 10:37:23,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 37 remaining) [2022-12-14 10:37:23,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 37 remaining) [2022-12-14 10:37:23,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 37 remaining) [2022-12-14 10:37:23,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 37 remaining) [2022-12-14 10:37:23,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 37 remaining) [2022-12-14 10:37:23,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 37 remaining) [2022-12-14 10:37:23,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 37 remaining) [2022-12-14 10:37:23,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 37 remaining) [2022-12-14 10:37:23,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 37 remaining) [2022-12-14 10:37:23,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 37 remaining) [2022-12-14 10:37:23,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 37 remaining) [2022-12-14 10:37:23,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 37 remaining) [2022-12-14 10:37:23,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 37 remaining) [2022-12-14 10:37:23,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 37 remaining) [2022-12-14 10:37:23,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 37 remaining) [2022-12-14 10:37:23,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 37 remaining) [2022-12-14 10:37:23,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 37 remaining) [2022-12-14 10:37:23,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 37 remaining) [2022-12-14 10:37:23,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 37 remaining) [2022-12-14 10:37:23,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 37 remaining) [2022-12-14 10:37:23,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 37 remaining) [2022-12-14 10:37:23,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 37 remaining) [2022-12-14 10:37:23,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (0 of 37 remaining) [2022-12-14 10:37:23,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 10:37:23,368 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:37:23,370 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 10:37:23,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 10:37:23 BoogieIcfgContainer [2022-12-14 10:37:23,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 10:37:23,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 10:37:23,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 10:37:23,373 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 10:37:23,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:37:21" (3/4) ... [2022-12-14 10:37:23,376 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 10:37:23,385 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-12-14 10:37:23,385 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-12-14 10:37:23,385 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-14 10:37:23,385 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 10:37:23,417 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 10:37:23,417 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 10:37:23,418 INFO L158 Benchmark]: Toolchain (without parser) took 2478.81ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 94.1MB in the beginning and 80.9MB in the end (delta: 13.2MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2022-12-14 10:37:23,418 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 10:37:23,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.42ms. Allocated memory is still 127.9MB. Free memory was 94.1MB in the beginning and 78.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 10:37:23,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.90ms. Allocated memory is still 127.9MB. Free memory was 78.2MB in the beginning and 76.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 10:37:23,419 INFO L158 Benchmark]: Boogie Preprocessor took 17.54ms. Allocated memory is still 127.9MB. Free memory was 76.2MB in the beginning and 75.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 10:37:23,419 INFO L158 Benchmark]: RCFGBuilder took 397.14ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 75.0MB in the beginning and 138.8MB in the end (delta: -63.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2022-12-14 10:37:23,420 INFO L158 Benchmark]: TraceAbstraction took 1725.58ms. Allocated memory is still 167.8MB. Free memory was 138.3MB in the beginning and 85.1MB in the end (delta: 53.2MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. [2022-12-14 10:37:23,420 INFO L158 Benchmark]: Witness Printer took 44.18ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 80.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 10:37:23,422 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.14ms. Allocated memory is still 127.9MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.42ms. Allocated memory is still 127.9MB. Free memory was 94.1MB in the beginning and 78.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.90ms. Allocated memory is still 127.9MB. Free memory was 78.2MB in the beginning and 76.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.54ms. Allocated memory is still 127.9MB. Free memory was 76.2MB in the beginning and 75.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 397.14ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 75.0MB in the beginning and 138.8MB in the end (delta: -63.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1725.58ms. Allocated memory is still 167.8MB. Free memory was 138.3MB in the beginning and 85.1MB in the end (delta: 53.2MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. * Witness Printer took 44.18ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 80.9MB 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: -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: -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: -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: -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: 567]: 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 1 procedures, 68 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 373 mSDsluCounter, 391 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 369 IncrementalHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 244 mSDtfsCounter, 369 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 37 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-14 10:37:23,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf2aef1-c12e-4df9-b668-279f34277309/bin/utaipan-gh47qXpMRh/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