./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 97c126101f069ab488324cfc4632ee48c30de136646e991b84ddea84d63344d8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:51:02,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:51:02,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:51:02,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:51:02,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:51:02,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:51:02,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:51:02,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:51:02,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:51:02,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:51:02,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:51:02,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:51:02,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:51:02,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:51:02,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:51:02,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:51:02,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:51:02,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:51:02,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:51:02,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:51:02,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:51:02,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:51:02,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:51:02,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:51:02,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:51:02,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:51:02,823 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:51:02,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:51:02,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:51:02,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:51:02,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:51:02,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:51:02,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:51:02,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:51:02,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:51:02,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:51:02,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:51:02,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:51:02,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:51:02,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:51:02,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:51:02,838 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-11-20 06:51:02,881 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:51:02,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:51:02,882 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:51:02,882 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:51:02,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:51:02,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:51:02,884 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:51:02,884 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-20 06:51:02,884 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-20 06:51:02,884 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-20 06:51:02,885 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-20 06:51:02,885 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-20 06:51:02,885 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-20 06:51:02,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:51:02,886 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 06:51:02,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:51:02,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:51:02,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-20 06:51:02,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-20 06:51:02,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-20 06:51:02,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:51:02,887 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-20 06:51:02,887 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:51:02,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-20 06:51:02,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:51:02,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:51:02,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:51:02,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:51:02,889 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:51:02,890 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-20 06:51:02,890 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/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_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF 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(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97c126101f069ab488324cfc4632ee48c30de136646e991b84ddea84d63344d8 [2021-11-20 06:51:03,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:51:03,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:51:03,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:51:03,185 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:51:03,186 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:51:03,187 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2021-11-20 06:51:03,259 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/data/0c0ffc540/0502e1c7f36e4a9dab9eaad8f21efed9/FLAG5f4da1930 [2021-11-20 06:51:03,811 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:51:03,811 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex1.i [2021-11-20 06:51:03,830 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/data/0c0ffc540/0502e1c7f36e4a9dab9eaad8f21efed9/FLAG5f4da1930 [2021-11-20 06:51:04,151 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/data/0c0ffc540/0502e1c7f36e4a9dab9eaad8f21efed9 [2021-11-20 06:51:04,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:51:04,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:51:04,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:51:04,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:51:04,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:51:04,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:51:04" (1/1) ... [2021-11-20 06:51:04,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae8a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:04, skipping insertion in model container [2021-11-20 06:51:04,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:51:04" (1/1) ... [2021-11-20 06:51:04,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:51:04,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:51:04,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:51:04,411 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:51:04,428 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:51:04,443 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:51:04,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:04 WrapperNode [2021-11-20 06:51:04,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:51:04,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:51:04,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:51:04,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:51:04,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:04" (1/1) ... [2021-11-20 06:51:04,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:04" (1/1) ... [2021-11-20 06:51:04,483 INFO L137 Inliner]: procedures = 11, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2021-11-20 06:51:04,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:51:04,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:51:04,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:51:04,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:51:04,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:04" (1/1) ... [2021-11-20 06:51:04,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:04" (1/1) ... [2021-11-20 06:51:04,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:04" (1/1) ... [2021-11-20 06:51:04,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:04" (1/1) ... [2021-11-20 06:51:04,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:04" (1/1) ... [2021-11-20 06:51:04,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:04" (1/1) ... [2021-11-20 06:51:04,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:04" (1/1) ... [2021-11-20 06:51:04,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:51:04,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:51:04,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:51:04,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:51:04,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:04" (1/1) ... [2021-11-20 06:51:04,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:51:04,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:51:04,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:51:04,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-20 06:51:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 06:51:04,613 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2021-11-20 06:51:04,614 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2021-11-20 06:51:04,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 06:51:04,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:51:04,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:51:04,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 06:51:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 06:51:04,702 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:51:04,703 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:51:04,953 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:51:04,959 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:51:04,959 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-20 06:51:04,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:51:04 BoogieIcfgContainer [2021-11-20 06:51:04,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:51:04,963 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-20 06:51:04,963 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-20 06:51:04,967 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-20 06:51:04,967 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:51:04,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 06:51:04" (1/3) ... [2021-11-20 06:51:04,969 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b243e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 06:51:04, skipping insertion in model container [2021-11-20 06:51:04,969 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:51:04,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:51:04" (2/3) ... [2021-11-20 06:51:04,970 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b243e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 06:51:04, skipping insertion in model container [2021-11-20 06:51:04,970 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:51:04,970 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:51:04" (3/3) ... [2021-11-20 06:51:04,971 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex1.i [2021-11-20 06:51:05,055 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-20 06:51:05,056 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-20 06:51:05,056 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-20 06:51:05,056 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-20 06:51:05,056 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-20 06:51:05,056 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-20 06:51:05,057 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-20 06:51:05,057 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-20 06:51:05,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:51:05,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-11-20 06:51:05,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:51:05,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:51:05,133 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-20 06:51:05,133 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:51:05,133 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-20 06:51:05,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:51:05,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-11-20 06:51:05,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:51:05,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:51:05,140 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-20 06:51:05,140 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:51:05,148 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 13#L28-3true [2021-11-20 06:51:05,150 INFO L793 eck$LassoCheckResult]: Loop: 13#L28-3true call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 11#L28-1true assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 5#L31true call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 12#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 10#L9true assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 16#recFINALtrue assume true; 15#recEXITtrue >#33#return; 14#L31-1true havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 13#L28-3true [2021-11-20 06:51:05,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:51:05,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2021-11-20 06:51:05,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:51:05,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171735234] [2021-11-20 06:51:05,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:51:05,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:51:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:05,364 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:51:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:05,459 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:51:05,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:51:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash 51331199, now seen corresponding path program 1 times [2021-11-20 06:51:05,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:51:05,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715085164] [2021-11-20 06:51:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:51:05,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:51:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:05,551 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:51:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:05,645 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:51:05,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:51:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1890018113, now seen corresponding path program 1 times [2021-11-20 06:51:05,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:51:05,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959492330] [2021-11-20 06:51:05,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:51:05,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:51:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:51:05,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 06:51:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:51:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:51:05,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:51:05,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959492330] [2021-11-20 06:51:05,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959492330] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:51:05,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:51:05,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 06:51:05,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460159000] [2021-11-20 06:51:05,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:51:06,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:51:06,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 06:51:06,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:51:06,924 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 06:51:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:51:07,062 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2021-11-20 06:51:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:51:07,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2021-11-20 06:51:07,079 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-11-20 06:51:07,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 16 transitions. [2021-11-20 06:51:07,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-20 06:51:07,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-20 06:51:07,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2021-11-20 06:51:07,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:51:07,095 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-20 06:51:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2021-11-20 06:51:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-20 06:51:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 06:51:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-20 06:51:07,142 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-20 06:51:07,142 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-20 06:51:07,142 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-20 06:51:07,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2021-11-20 06:51:07,144 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-11-20 06:51:07,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:51:07,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:51:07,145 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-20 06:51:07,146 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:51:07,146 INFO L791 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 59#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 66#L28-3 [2021-11-20 06:51:07,146 INFO L793 eck$LassoCheckResult]: Loop: 66#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 64#L28-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 62#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 65#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 60#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 61#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 65#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 60#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 63#recFINAL assume true; 67#recEXIT >#31#return; 68#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 70#recFINAL assume true; 71#recEXIT >#33#return; 69#L31-1 havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 66#L28-3 [2021-11-20 06:51:07,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:51:07,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2021-11-20 06:51:07,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:51:07,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566806278] [2021-11-20 06:51:07,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:51:07,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:51:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:07,175 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:51:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:07,203 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:51:07,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:51:07,204 INFO L85 PathProgramCache]: Analyzing trace with hash 198344305, now seen corresponding path program 1 times [2021-11-20 06:51:07,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:51:07,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146811288] [2021-11-20 06:51:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:51:07,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:51:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:51:07,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:51:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:51:07,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:51:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:51:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:51:07,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:51:07,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146811288] [2021-11-20 06:51:07,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146811288] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:51:07,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762407464] [2021-11-20 06:51:07,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:51:07,499 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:51:07,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:51:07,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:51:07,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 06:51:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:51:07,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 06:51:07,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:51:07,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2021-11-20 06:51:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:51:07,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:51:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 06:51:08,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762407464] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:51:08,302 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:51:08,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2021-11-20 06:51:08,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188038902] [2021-11-20 06:51:08,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:51:08,303 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:51:08,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:51:08,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-20 06:51:08,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-11-20 06:51:08,307 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 17 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 06:51:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:51:08,460 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-11-20 06:51:08,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:51:08,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2021-11-20 06:51:08,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-11-20 06:51:08,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2021-11-20 06:51:08,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-11-20 06:51:08,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-11-20 06:51:08,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2021-11-20 06:51:08,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:51:08,471 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-11-20 06:51:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2021-11-20 06:51:08,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-20 06:51:08,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 06:51:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-11-20 06:51:08,475 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-11-20 06:51:08,476 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-11-20 06:51:08,476 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-20 06:51:08,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2021-11-20 06:51:08,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-11-20 06:51:08,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:51:08,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:51:08,481 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-20 06:51:08,481 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-20 06:51:08,481 INFO L791 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 208#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 218#L28-3 [2021-11-20 06:51:08,481 INFO L793 eck$LassoCheckResult]: Loop: 218#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 213#L28-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 210#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 214#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 209#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 211#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 214#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 209#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 211#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 214#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 209#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 212#recFINAL assume true; 215#recEXIT >#31#return; 216#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 219#recFINAL assume true; 223#recEXIT >#31#return; 221#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 222#recFINAL assume true; 220#recEXIT >#33#return; 217#L31-1 havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 218#L28-3 [2021-11-20 06:51:08,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:51:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2021-11-20 06:51:08,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:51:08,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167770117] [2021-11-20 06:51:08,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:51:08,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:51:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:08,515 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:51:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:08,534 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:51:08,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:51:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1148543297, now seen corresponding path program 2 times [2021-11-20 06:51:08,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:51:08,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343790602] [2021-11-20 06:51:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:51:08,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:51:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:51:08,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:51:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:51:08,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:51:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:51:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 06:51:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:51:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 06:51:08,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:51:08,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343790602] [2021-11-20 06:51:08,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343790602] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:51:08,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763138444] [2021-11-20 06:51:08,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:51:08,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:51:08,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:51:08,768 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:51:08,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 06:51:08,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:51:08,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:51:08,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 06:51:08,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:51:08,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2021-11-20 06:51:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:51:09,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:51:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 06:51:09,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763138444] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:51:09,683 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:51:09,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 21 [2021-11-20 06:51:09,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879860601] [2021-11-20 06:51:09,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:51:09,684 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-20 06:51:09,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:51:09,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 06:51:09,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-11-20 06:51:09,685 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 21 states, 16 states have (on average 1.875) internal successors, (30), 19 states have internal predecessors, (30), 8 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2021-11-20 06:51:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:51:09,866 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2021-11-20 06:51:09,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 06:51:09,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2021-11-20 06:51:09,869 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-11-20 06:51:09,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2021-11-20 06:51:09,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-11-20 06:51:09,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-11-20 06:51:09,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2021-11-20 06:51:09,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:51:09,872 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-11-20 06:51:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2021-11-20 06:51:09,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-20 06:51:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 06:51:09,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-11-20 06:51:09,875 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-11-20 06:51:09,876 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-11-20 06:51:09,876 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-20 06:51:09,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2021-11-20 06:51:09,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-11-20 06:51:09,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:51:09,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:51:09,878 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-20 06:51:09,878 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-11-20 06:51:09,878 INFO L791 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 421#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem9#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet7#1;call write~int(main_#t~nondet8#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet8#1; 431#L28-3 [2021-11-20 06:51:09,879 INFO L793 eck$LassoCheckResult]: Loop: 431#L28-3 call main_#t~mem9#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 426#L28-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call write~int(main_#t~mem10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~mem10#1;call write~int(-1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 423#L31 call rec(main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem11#1);< 427#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 422#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 424#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 427#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 422#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 424#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 427#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 422#L9 assume !(~i < 0);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call write~int(#t~nondet4, ~ip~0.base, ~ip~0.offset, 4);havoc #t~nondet4; 424#L16 call rec(~ip~0.base, ~ip~0.offset, ~i - 1);< 427#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;~i := #in~i; 422#L9 assume ~i < 0;call #t~mem1 := read~int(~op.base, ~op.offset, 4);#t~post2 := #t~mem1;call write~int(#t~post2 - 1, ~op.base, ~op.offset, 4);havoc #t~mem1;havoc #t~post2; 425#recFINAL assume true; 428#recEXIT >#31#return; 429#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 432#recFINAL assume true; 439#recEXIT >#31#return; 438#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 437#recFINAL assume true; 436#recEXIT >#31#return; 434#L16-1 call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset); 435#recFINAL assume true; 433#recEXIT >#33#return; 430#L31-1 havoc main_#t~mem11#1;call main_#t~mem12#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);call write~int(main_#t~mem12#1 + main_#t~mem13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem12#1;havoc main_#t~mem13#1; 431#L28-3 [2021-11-20 06:51:09,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:51:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2021-11-20 06:51:09,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:51:09,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57823495] [2021-11-20 06:51:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:51:09,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:51:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:09,886 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:51:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:09,893 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:51:09,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:51:09,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1161179343, now seen corresponding path program 3 times [2021-11-20 06:51:09,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:51:09,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543916921] [2021-11-20 06:51:09,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:51:09,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:51:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:09,930 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:51:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:09,994 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:51:09,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:51:09,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1853588851, now seen corresponding path program 1 times [2021-11-20 06:51:09,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:51:09,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521667411] [2021-11-20 06:51:09,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:51:09,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:51:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:10,036 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:51:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:51:10,096 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:51:14,322 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:51:14,323 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:51:14,323 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:51:14,323 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:51:14,323 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:51:14,324 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:51:14,324 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:51:14,324 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:51:14,324 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex1.i_Iteration4_Lasso [2021-11-20 06:51:14,324 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:51:14,325 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:51:14,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:51:14,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:51:14,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:51:14,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:51:14,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:51:14,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:51:14,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:51:14,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:51:14,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:51:14,485 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-20 06:51:14,489 INFO L158 Benchmark]: Toolchain (without parser) took 10332.57ms. Allocated memory was 107.0MB in the beginning and 163.6MB in the end (delta: 56.6MB). Free memory was 69.8MB in the beginning and 95.2MB in the end (delta: -25.5MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2021-11-20 06:51:14,490 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 107.0MB. Free memory was 77.9MB in the beginning and 77.9MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:51:14,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.28ms. Allocated memory is still 107.0MB. Free memory was 69.6MB in the beginning and 76.7MB in the end (delta: -7.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-20 06:51:14,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.61ms. Allocated memory is still 107.0MB. Free memory was 76.7MB in the beginning and 75.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 06:51:14,492 INFO L158 Benchmark]: Boogie Preprocessor took 26.58ms. Allocated memory is still 107.0MB. Free memory was 75.1MB in the beginning and 74.3MB in the end (delta: 758.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:51:14,492 INFO L158 Benchmark]: RCFGBuilder took 449.42ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 63.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-20 06:51:14,493 INFO L158 Benchmark]: BuchiAutomizer took 9524.59ms. Allocated memory was 107.0MB in the beginning and 163.6MB in the end (delta: 56.6MB). Free memory was 63.5MB in the beginning and 95.2MB in the end (delta: -31.7MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2021-11-20 06:51:14,497 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.25ms. Allocated memory is still 107.0MB. Free memory was 77.9MB in the beginning and 77.9MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.28ms. Allocated memory is still 107.0MB. Free memory was 69.6MB in the beginning and 76.7MB in the end (delta: -7.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.61ms. Allocated memory is still 107.0MB. Free memory was 76.7MB in the beginning and 75.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.58ms. Allocated memory is still 107.0MB. Free memory was 75.1MB in the beginning and 74.3MB in the end (delta: 758.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 449.42ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 63.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 9524.59ms. Allocated memory was 107.0MB in the beginning and 163.6MB in the end (delta: 56.6MB). Free memory was 63.5MB in the beginning and 95.2MB in the end (delta: -31.7MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-20 06:51:14,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 06:51:14,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 06:51:14,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5260de31-0d2e-439b-bcb0-68f1ec66b7e6/bin/uautomizer-DQz5hQGWxF/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int)