./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG --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 32bit --witnessprinter.graph.data.programhash 279a496440714e08b745bf93c9b96ddf5eea3a1a1333716a32e013acf1d533d2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 05:56:10,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 05:56:10,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 05:56:10,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 05:56:10,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 05:56:10,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 05:56:10,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 05:56:10,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 05:56:10,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 05:56:10,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 05:56:10,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 05:56:10,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 05:56:10,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 05:56:10,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 05:56:10,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 05:56:10,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 05:56:10,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 05:56:10,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 05:56:10,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 05:56:10,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 05:56:10,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 05:56:10,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 05:56:10,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 05:56:10,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 05:56:10,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 05:56:10,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 05:56:10,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 05:56:10,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 05:56:10,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 05:56:10,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 05:56:10,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 05:56:10,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 05:56:10,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 05:56:10,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 05:56:10,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 05:56:10,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 05:56:10,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 05:56:10,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 05:56:10,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 05:56:10,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 05:56:10,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 05:56:10,854 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-10-29 05:56:10,898 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 05:56:10,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 05:56:10,903 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 05:56:10,903 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 05:56:10,904 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 05:56:10,910 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 05:56:10,910 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 05:56:10,911 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 05:56:10,911 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 05:56:10,911 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 05:56:10,912 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 05:56:10,912 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 05:56:10,913 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 05:56:10,913 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 05:56:10,913 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 05:56:10,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 05:56:10,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 05:56:10,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 05:56:10,915 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 05:56:10,915 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-29 05:56:10,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 05:56:10,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 05:56:10,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 05:56:10,916 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-29 05:56:10,916 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-29 05:56:10,916 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-29 05:56:10,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 05:56:10,918 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 05:56:10,918 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 05:56:10,918 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 05:56:10,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 05:56:10,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 05:56:10,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:56:10,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 05:56:10,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 05:56:10,920 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 05:56:10,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 05:56:10,920 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 05:56:10,921 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 05:56:10,921 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/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_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 279a496440714e08b745bf93c9b96ddf5eea3a1a1333716a32e013acf1d533d2 [2021-10-29 05:56:11,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 05:56:11,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 05:56:11,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 05:56:11,207 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 05:56:11,208 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 05:56:11,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2021-10-29 05:56:11,277 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/data/c18de2134/12631a8d1eee47c1a5cf5d29b72a9feb/FLAGdb0e5c467 [2021-10-29 05:56:11,828 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 05:56:11,829 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2021-10-29 05:56:11,844 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/data/c18de2134/12631a8d1eee47c1a5cf5d29b72a9feb/FLAGdb0e5c467 [2021-10-29 05:56:12,108 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/data/c18de2134/12631a8d1eee47c1a5cf5d29b72a9feb [2021-10-29 05:56:12,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 05:56:12,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 05:56:12,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 05:56:12,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 05:56:12,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 05:56:12,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:56:12" (1/1) ... [2021-10-29 05:56:12,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9df61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:56:12, skipping insertion in model container [2021-10-29 05:56:12,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:56:12" (1/1) ... [2021-10-29 05:56:12,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 05:56:12,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 05:56:12,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:56:12,552 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 05:56:12,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:56:12,636 INFO L208 MainTranslator]: Completed translation [2021-10-29 05:56:12,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:56:12 WrapperNode [2021-10-29 05:56:12,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 05:56:12,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 05:56:12,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 05:56:12,639 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 05:56:12,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:56:12" (1/1) ... [2021-10-29 05:56:12,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:56:12" (1/1) ... [2021-10-29 05:56:12,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 05:56:12,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 05:56:12,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 05:56:12,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 05:56:12,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:56:12" (1/1) ... [2021-10-29 05:56:12,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:56:12" (1/1) ... [2021-10-29 05:56:12,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:56:12" (1/1) ... [2021-10-29 05:56:12,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:56:12" (1/1) ... [2021-10-29 05:56:12,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:56:12" (1/1) ... [2021-10-29 05:56:12,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:56:12" (1/1) ... [2021-10-29 05:56:12,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:56:12" (1/1) ... [2021-10-29 05:56:12,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 05:56:12,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 05:56:12,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 05:56:12,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 05:56:12,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:56:12" (1/1) ... [2021-10-29 05:56:12,806 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:56:12,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:56:12,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 05:56:12,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 05:56:12,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-29 05:56:12,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-29 05:56:12,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 05:56:12,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-29 05:56:12,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 05:56:12,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 05:56:13,300 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 05:56:13,300 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-29 05:56:13,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:56:13 BoogieIcfgContainer [2021-10-29 05:56:13,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 05:56:13,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 05:56:13,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 05:56:13,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 05:56:13,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 05:56:12" (1/3) ... [2021-10-29 05:56:13,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bf6902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:56:13, skipping insertion in model container [2021-10-29 05:56:13,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:56:12" (2/3) ... [2021-10-29 05:56:13,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bf6902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:56:13, skipping insertion in model container [2021-10-29 05:56:13,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:56:13" (3/3) ... [2021-10-29 05:56:13,325 INFO L111 eAbstractionObserver]: Analyzing ICFG c.03-alloca-2.i [2021-10-29 05:56:13,331 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 05:56:13,344 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2021-10-29 05:56:13,391 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 05:56:13,398 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 05:56:13,399 INFO L340 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2021-10-29 05:56:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 19 states have (on average 2.789473684210526) internal successors, (53), 50 states have internal predecessors, (53), 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) [2021-10-29 05:56:13,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-29 05:56:13,422 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:56:13,423 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-10-29 05:56:13,423 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-29 05:56:13,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:56:13,430 INFO L85 PathProgramCache]: Analyzing trace with hash 3383, now seen corresponding path program 1 times [2021-10-29 05:56:13,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:56:13,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571059357] [2021-10-29 05:56:13,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:56:13,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:56:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:56:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:56:13,688 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:56:13,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571059357] [2021-10-29 05:56:13,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571059357] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:56:13,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:56:13,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 05:56:13,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734381982] [2021-10-29 05:56:13,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:56:13,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:56:13,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:56:13,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:56:13,717 INFO L87 Difference]: Start difference. First operand has 51 states, 19 states have (on average 2.789473684210526) internal successors, (53), 50 states have internal predecessors, (53), 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) [2021-10-29 05:56:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:56:13,812 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2021-10-29 05:56:13,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:56:13,814 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 [2021-10-29 05:56:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:56:13,822 INFO L225 Difference]: With dead ends: 46 [2021-10-29 05:56:13,823 INFO L226 Difference]: Without dead ends: 45 [2021-10-29 05:56:13,824 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:56:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-10-29 05:56:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-10-29 05:56:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 44 states have internal predecessors, (46), 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) [2021-10-29 05:56:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-10-29 05:56:13,871 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 2 [2021-10-29 05:56:13,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:56:13,872 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-10-29 05:56:13,872 INFO L471 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) [2021-10-29 05:56:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-10-29 05:56:13,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-29 05:56:13,873 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:56:13,873 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-10-29 05:56:13,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 05:56:13,874 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-29 05:56:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:56:13,880 INFO L85 PathProgramCache]: Analyzing trace with hash 3384, now seen corresponding path program 1 times [2021-10-29 05:56:13,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:56:13,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088559149] [2021-10-29 05:56:13,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:56:13,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:56:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:56:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:56:14,024 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:56:14,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088559149] [2021-10-29 05:56:14,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088559149] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:56:14,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:56:14,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 05:56:14,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982205494] [2021-10-29 05:56:14,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:56:14,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:56:14,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:56:14,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:56:14,029 INFO L87 Difference]: Start difference. First operand 45 states and 46 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) [2021-10-29 05:56:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:56:14,082 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2021-10-29 05:56:14,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:56:14,083 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 [2021-10-29 05:56:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:56:14,084 INFO L225 Difference]: With dead ends: 40 [2021-10-29 05:56:14,085 INFO L226 Difference]: Without dead ends: 40 [2021-10-29 05:56:14,086 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:56:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-10-29 05:56:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-10-29 05:56:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 39 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) [2021-10-29 05:56:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-10-29 05:56:14,096 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 2 [2021-10-29 05:56:14,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:56:14,097 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-10-29 05:56:14,097 INFO L471 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) [2021-10-29 05:56:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2021-10-29 05:56:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-29 05:56:14,099 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:56:14,099 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-29 05:56:14,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 05:56:14,100 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-29 05:56:14,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:56:14,101 INFO L85 PathProgramCache]: Analyzing trace with hash 104849, now seen corresponding path program 1 times [2021-10-29 05:56:14,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:56:14,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475833540] [2021-10-29 05:56:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:56:14,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:56:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:56:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:56:14,194 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:56:14,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475833540] [2021-10-29 05:56:14,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475833540] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:56:14,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:56:14,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 05:56:14,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677360067] [2021-10-29 05:56:14,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:56:14,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:56:14,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:56:14,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:56:14,230 INFO L87 Difference]: Start difference. First operand 40 states and 41 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) [2021-10-29 05:56:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:56:14,292 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2021-10-29 05:56:14,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:56:14,293 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 [2021-10-29 05:56:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:56:14,296 INFO L225 Difference]: With dead ends: 38 [2021-10-29 05:56:14,297 INFO L226 Difference]: Without dead ends: 38 [2021-10-29 05:56:14,297 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:56:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-10-29 05:56:14,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-10-29 05:56:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 37 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) [2021-10-29 05:56:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2021-10-29 05:56:14,305 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 3 [2021-10-29 05:56:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:56:14,305 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2021-10-29 05:56:14,306 INFO L471 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) [2021-10-29 05:56:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2021-10-29 05:56:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-29 05:56:14,306 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:56:14,307 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-29 05:56:14,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 05:56:14,307 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-29 05:56:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:56:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash 104850, now seen corresponding path program 1 times [2021-10-29 05:56:14,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:56:14,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762908862] [2021-10-29 05:56:14,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:56:14,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:56:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:56:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:56:14,419 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:56:14,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762908862] [2021-10-29 05:56:14,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762908862] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:56:14,420 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:56:14,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 05:56:14,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367379008] [2021-10-29 05:56:14,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:56:14,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:56:14,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:56:14,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:56:14,428 INFO L87 Difference]: Start difference. First operand 38 states and 39 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) [2021-10-29 05:56:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:56:14,480 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2021-10-29 05:56:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:56:14,480 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 [2021-10-29 05:56:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:56:14,481 INFO L225 Difference]: With dead ends: 36 [2021-10-29 05:56:14,481 INFO L226 Difference]: Without dead ends: 36 [2021-10-29 05:56:14,482 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:56:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-10-29 05:56:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-10-29 05:56:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 35 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) [2021-10-29 05:56:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2021-10-29 05:56:14,486 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 3 [2021-10-29 05:56:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:56:14,487 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2021-10-29 05:56:14,487 INFO L471 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) [2021-10-29 05:56:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2021-10-29 05:56:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-29 05:56:14,488 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:56:14,488 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-29 05:56:14,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 05:56:14,489 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-29 05:56:14,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:56:14,489 INFO L85 PathProgramCache]: Analyzing trace with hash 3250298, now seen corresponding path program 1 times [2021-10-29 05:56:14,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:56:14,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316809405] [2021-10-29 05:56:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:56:14,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:56:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:56:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:56:14,545 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:56:14,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316809405] [2021-10-29 05:56:14,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316809405] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:56:14,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:56:14,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 05:56:14,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487410683] [2021-10-29 05:56:14,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:56:14,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:56:14,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:56:14,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:56:14,548 INFO L87 Difference]: Start difference. First operand 36 states and 37 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) [2021-10-29 05:56:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:56:14,595 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2021-10-29 05:56:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:56:14,595 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 [2021-10-29 05:56:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:56:14,596 INFO L225 Difference]: With dead ends: 32 [2021-10-29 05:56:14,597 INFO L226 Difference]: Without dead ends: 32 [2021-10-29 05:56:14,597 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:56:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-10-29 05:56:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-10-29 05:56:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.736842105263158) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:56:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-10-29 05:56:14,606 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 4 [2021-10-29 05:56:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:56:14,607 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-10-29 05:56:14,607 INFO L471 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) [2021-10-29 05:56:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-10-29 05:56:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-29 05:56:14,608 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:56:14,608 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-29 05:56:14,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 05:56:14,609 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-29 05:56:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:56:14,609 INFO L85 PathProgramCache]: Analyzing trace with hash 3250299, now seen corresponding path program 1 times [2021-10-29 05:56:14,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:56:14,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194981542] [2021-10-29 05:56:14,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:56:14,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:56:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:56:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:56:14,713 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:56:14,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194981542] [2021-10-29 05:56:14,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194981542] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:56:14,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:56:14,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 05:56:14,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748076119] [2021-10-29 05:56:14,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:56:14,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:56:14,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:56:14,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:56:14,718 INFO L87 Difference]: Start difference. First operand 32 states and 33 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) [2021-10-29 05:56:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:56:14,757 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2021-10-29 05:56:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:56:14,758 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 [2021-10-29 05:56:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:56:14,760 INFO L225 Difference]: With dead ends: 28 [2021-10-29 05:56:14,761 INFO L226 Difference]: Without dead ends: 28 [2021-10-29 05:56:14,761 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:56:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-10-29 05:56:14,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-10-29 05:56:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:56:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2021-10-29 05:56:14,769 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 4 [2021-10-29 05:56:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:56:14,770 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-10-29 05:56:14,770 INFO L471 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) [2021-10-29 05:56:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2021-10-29 05:56:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-29 05:56:14,771 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:56:14,771 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-29 05:56:14,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 05:56:14,772 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-29 05:56:14,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:56:14,772 INFO L85 PathProgramCache]: Analyzing trace with hash 100759220, now seen corresponding path program 1 times [2021-10-29 05:56:14,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:56:14,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819694331] [2021-10-29 05:56:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:56:14,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:56:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:56:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:56:14,845 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:56:14,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819694331] [2021-10-29 05:56:14,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819694331] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:56:14,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:56:14,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 05:56:14,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355543183] [2021-10-29 05:56:14,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:56:14,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:56:14,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:56:14,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:56:14,849 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:56:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:56:14,885 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2021-10-29 05:56:14,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:56:14,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-29 05:56:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:56:14,887 INFO L225 Difference]: With dead ends: 24 [2021-10-29 05:56:14,887 INFO L226 Difference]: Without dead ends: 24 [2021-10-29 05:56:14,888 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:56:14,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-10-29 05:56:14,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-10-29 05:56:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:56:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-10-29 05:56:14,892 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 5 [2021-10-29 05:56:14,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:56:14,892 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-10-29 05:56:14,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:56:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-10-29 05:56:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-29 05:56:14,893 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:56:14,893 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-29 05:56:14,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 05:56:14,895 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-29 05:56:14,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:56:14,897 INFO L85 PathProgramCache]: Analyzing trace with hash 100759221, now seen corresponding path program 1 times [2021-10-29 05:56:14,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:56:14,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083722870] [2021-10-29 05:56:14,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:56:14,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:56:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:56:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:56:14,966 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:56:14,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083722870] [2021-10-29 05:56:14,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083722870] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:56:14,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:56:14,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 05:56:14,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495700529] [2021-10-29 05:56:14,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:56:14,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:56:14,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:56:14,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:56:14,968 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:56:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:56:15,000 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-10-29 05:56:15,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:56:15,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-29 05:56:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:56:15,005 INFO L225 Difference]: With dead ends: 20 [2021-10-29 05:56:15,005 INFO L226 Difference]: Without dead ends: 20 [2021-10-29 05:56:15,005 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:56:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-29 05:56:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-29 05:56:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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) [2021-10-29 05:56:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2021-10-29 05:56:15,021 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 5 [2021-10-29 05:56:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:56:15,024 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-10-29 05:56:15,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:56:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2021-10-29 05:56:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 05:56:15,024 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:56:15,024 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:56:15,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 05:56:15,025 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-29 05:56:15,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:56:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash 553774910, now seen corresponding path program 1 times [2021-10-29 05:56:15,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:56:15,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764889609] [2021-10-29 05:56:15,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:56:15,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:56:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:56:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:56:15,274 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:56:15,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764889609] [2021-10-29 05:56:15,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764889609] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:56:15,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:56:15,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:56:15,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303126031] [2021-10-29 05:56:15,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:56:15,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:56:15,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:56:15,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:56:15,276 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:56:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:56:15,328 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2021-10-29 05:56:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:56:15,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-29 05:56:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:56:15,331 INFO L225 Difference]: With dead ends: 19 [2021-10-29 05:56:15,332 INFO L226 Difference]: Without dead ends: 0 [2021-10-29 05:56:15,337 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:56:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-29 05:56:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-29 05:56:15,337 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) [2021-10-29 05:56:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-29 05:56:15,338 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2021-10-29 05:56:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:56:15,338 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 05:56:15,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:56:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-29 05:56:15,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-29 05:56:15,341 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-29 05:56:15,341 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-29 05:56:15,341 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-29 05:56:15,342 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-29 05:56:15,342 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-29 05:56:15,342 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-29 05:56:15,342 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-29 05:56:15,342 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-29 05:56:15,342 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-29 05:56:15,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-29 05:56:15,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-29 05:56:15,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-29 05:56:15,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-29 05:56:15,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-29 05:56:15,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-29 05:56:15,344 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-29 05:56:15,344 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-29 05:56:15,344 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-29 05:56:15,344 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-29 05:56:15,344 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-29 05:56:15,344 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-29 05:56:15,345 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-29 05:56:15,345 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-29 05:56:15,345 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-29 05:56:15,345 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-29 05:56:15,345 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-29 05:56:15,345 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-29 05:56:15,346 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-29 05:56:15,346 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-29 05:56:15,346 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-29 05:56:15,346 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 05:56:15,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 05:56:15,354 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:56:15,356 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:56:15,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:56:15 BoogieIcfgContainer [2021-10-29 05:56:15,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:56:15,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:56:15,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:56:15,360 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:56:15,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:56:13" (3/4) ... [2021-10-29 05:56:15,365 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-29 05:56:15,378 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2021-10-29 05:56:15,378 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-29 05:56:15,379 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-29 05:56:15,457 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:56:15,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:56:15,458 INFO L168 Benchmark]: Toolchain (without parser) took 3343.25 ms. Allocated memory is still 132.1 MB. Free memory was 98.3 MB in the beginning and 105.8 MB in the end (delta: -7.5 MB). Peak memory consumption was 50.7 MB. Max. memory is 16.1 GB. [2021-10-29 05:56:15,459 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 92.3 MB. Free memory is still 47.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:56:15,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 518.17 ms. Allocated memory is still 132.1 MB. Free memory was 98.0 MB in the beginning and 102.3 MB in the end (delta: -4.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 05:56:15,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.01 ms. Allocated memory is still 132.1 MB. Free memory was 101.9 MB in the beginning and 99.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:56:15,460 INFO L168 Benchmark]: Boogie Preprocessor took 59.62 ms. Allocated memory is still 132.1 MB. Free memory was 99.9 MB in the beginning and 98.9 MB in the end (delta: 997.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:56:15,461 INFO L168 Benchmark]: RCFGBuilder took 514.49 ms. Allocated memory is still 132.1 MB. Free memory was 98.9 MB in the beginning and 82.7 MB in the end (delta: 16.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-29 05:56:15,461 INFO L168 Benchmark]: TraceAbstraction took 2054.07 ms. Allocated memory is still 132.1 MB. Free memory was 82.1 MB in the beginning and 50.8 MB in the end (delta: 31.4 MB). Peak memory consumption was 32.6 MB. Max. memory is 16.1 GB. [2021-10-29 05:56:15,461 INFO L168 Benchmark]: Witness Printer took 97.41 ms. Allocated memory is still 132.1 MB. Free memory was 50.8 MB in the beginning and 105.8 MB in the end (delta: -55.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:56:15,463 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.23 ms. Allocated memory is still 92.3 MB. Free memory is still 47.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 518.17 ms. Allocated memory is still 132.1 MB. Free memory was 98.0 MB in the beginning and 102.3 MB in the end (delta: -4.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 89.01 ms. Allocated memory is still 132.1 MB. Free memory was 101.9 MB in the beginning and 99.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 59.62 ms. Allocated memory is still 132.1 MB. Free memory was 99.9 MB in the beginning and 98.9 MB in the end (delta: 997.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 514.49 ms. Allocated memory is still 132.1 MB. Free memory was 98.9 MB in the beginning and 82.7 MB in the end (delta: 16.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2054.07 ms. Allocated memory is still 132.1 MB. Free memory was 82.1 MB in the beginning and 50.8 MB in the end (delta: 31.4 MB). Peak memory consumption was 32.6 MB. Max. memory is 16.1 GB. * Witness Printer took 97.41 ms. Allocated memory is still 132.1 MB. Free memory was 50.8 MB in the beginning and 105.8 MB in the end (delta: -55.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 16.1 GB. * 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: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: 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, 51 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 98 SDtfs, 254 SDslu, 4 SDs, 0 SdLazy, 219 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 28, 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-29 05:56:15,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a72b858-7973-4c82-acb9-06a842c34428/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...