./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be --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 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:45:54,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:45:54,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:45:54,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:45:54,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:45:54,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:45:54,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:45:54,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:45:54,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:45:54,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:45:54,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:45:54,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:45:54,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:45:54,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:45:54,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:45:54,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:45:54,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:45:54,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:45:54,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:45:54,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:45:54,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:45:54,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:45:54,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:45:54,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:45:54,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:45:54,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:45:54,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:45:54,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:45:54,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:45:54,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:45:54,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:45:54,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:45:54,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:45:54,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:45:54,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:45:54,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:45:54,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:45:54,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:45:54,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:45:54,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:45:54,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:45:54,819 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-21 19:45:54,848 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:45:54,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:45:54,849 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:45:54,849 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:45:54,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:45:54,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:45:54,851 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:45:54,851 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-21 19:45:54,852 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-21 19:45:54,852 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-21 19:45:54,853 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-21 19:45:54,853 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-21 19:45:54,853 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-21 19:45:54,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:45:54,854 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:45:54,855 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 19:45:54,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:45:54,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:45:54,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:45:54,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-21 19:45:54,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-21 19:45:54,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-21 19:45:54,857 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:45:54,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:45:54,858 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-21 19:45:54,858 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:45:54,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-21 19:45:54,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:45:54,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:45:54,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:45:54,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:45:54,861 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:45:54,862 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-21 19:45:54,862 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_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/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_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2021-10-21 19:45:55,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:45:55,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:45:55,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:45:55,151 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:45:55,153 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:45:55,154 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-10-21 19:45:55,245 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/data/ec7656974/3b24785330734bf2bc2d36e8217e3644/FLAGa78404f57 [2021-10-21 19:45:55,701 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:45:55,701 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-10-21 19:45:55,715 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/data/ec7656974/3b24785330734bf2bc2d36e8217e3644/FLAGa78404f57 [2021-10-21 19:45:56,046 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/data/ec7656974/3b24785330734bf2bc2d36e8217e3644 [2021-10-21 19:45:56,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:45:56,050 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:45:56,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:45:56,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:45:56,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:45:56,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:45:56" (1/1) ... [2021-10-21 19:45:56,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d4e067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:45:56, skipping insertion in model container [2021-10-21 19:45:56,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:45:56" (1/1) ... [2021-10-21 19:45:56,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:45:56,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:45:56,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:45:56,417 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:45:56,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:45:56,486 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:45:56,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:45:56 WrapperNode [2021-10-21 19:45:56,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:45:56,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:45:56,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:45:56,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:45:56,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:45:56" (1/1) ... [2021-10-21 19:45:56,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:45:56" (1/1) ... [2021-10-21 19:45:56,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:45:56,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:45:56,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:45:56,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:45:56,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:45:56" (1/1) ... [2021-10-21 19:45:56,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:45:56" (1/1) ... [2021-10-21 19:45:56,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:45:56" (1/1) ... [2021-10-21 19:45:56,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:45:56" (1/1) ... [2021-10-21 19:45:56,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:45:56" (1/1) ... [2021-10-21 19:45:56,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:45:56" (1/1) ... [2021-10-21 19:45:56,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:45:56" (1/1) ... [2021-10-21 19:45:56,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:45:56,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:45:56,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:45:56,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:45:56,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:45:56" (1/1) ... [2021-10-21 19:45:56,586 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:45:56,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:45:56,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:45:56,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-21 19:45:56,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-21 19:45:56,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 19:45:56,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:45:56,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 19:45:56,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:45:56,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:45:57,011 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:45:57,012 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-10-21 19:45:57,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:45:57 BoogieIcfgContainer [2021-10-21 19:45:57,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:45:57,018 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-21 19:45:57,018 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-21 19:45:57,021 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-21 19:45:57,024 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:45:57,025 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.10 07:45:56" (1/3) ... [2021-10-21 19:45:57,026 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ae63d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:45:57, skipping insertion in model container [2021-10-21 19:45:57,027 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:45:57,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:45:56" (2/3) ... [2021-10-21 19:45:57,028 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ae63d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:45:57, skipping insertion in model container [2021-10-21 19:45:57,028 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:45:57,029 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:45:57" (3/3) ... [2021-10-21 19:45:57,030 INFO L389 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2021-10-21 19:45:57,099 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-21 19:45:57,099 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-21 19:45:57,100 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-21 19:45:57,100 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-21 19:45:57,100 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-21 19:45:57,100 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-21 19:45:57,100 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-21 19:45:57,100 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-21 19:45:57,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 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-21 19:45:57,143 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-10-21 19:45:57,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:45:57,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:45:57,150 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-21 19:45:57,150 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-21 19:45:57,150 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-21 19:45:57,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 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-21 19:45:57,156 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-10-21 19:45:57,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:45:57,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:45:57,157 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-21 19:45:57,157 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-21 19:45:57,165 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 11#L530true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7#L530-2true call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 4#L535-3true [2021-10-21 19:45:57,166 INFO L793 eck$LassoCheckResult]: Loop: 4#L535-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 17#L535-2true main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4#L535-3true [2021-10-21 19:45:57,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:45:57,188 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-10-21 19:45:57,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:45:57,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579252751] [2021-10-21 19:45:57,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:45:57,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:45:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:57,306 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:45:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:57,335 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:45:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:45:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-10-21 19:45:57,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:45:57,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169858961] [2021-10-21 19:45:57,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:45:57,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:45:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:57,351 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:45:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:57,361 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:45:57,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:45:57,363 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-10-21 19:45:57,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:45:57,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373174427] [2021-10-21 19:45:57,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:45:57,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:45:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:57,387 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:45:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:57,408 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:45:57,766 INFO L210 LassoAnalysis]: Preferences: [2021-10-21 19:45:57,766 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-21 19:45:57,767 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-21 19:45:57,767 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-21 19:45:57,767 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-21 19:45:57,767 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:45:57,767 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-21 19:45:57,768 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-21 19:45:57,768 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2021-10-21 19:45:57,768 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-21 19:45:57,768 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-21 19:45:57,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:45:57,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:45:57,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:45:57,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:45:57,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:45:57,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:45:57,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:45:57,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:45:57,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:45:57,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:45:58,116 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-21 19:45:58,120 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-21 19:45:58,122 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:45:58,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:45:58,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:45:58,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:45:58,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:45:58,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:45:58,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:45:58,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:45:58,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:45:58,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:45:58,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:45:58,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-10-21 19:45:58,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:45:58,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-10-21 19:45:58,199 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:45:58,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:45:58,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:45:58,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-10-21 19:45:58,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:45:58,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:45:58,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:45:58,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:45:58,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:45:58,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:45:58,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:45:58,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:45:58,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:45:58,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-10-21 19:45:58,284 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:45:58,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:45:58,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:45:58,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-10-21 19:45:58,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:45:58,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:45:58,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:45:58,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:45:58,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:45:58,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:45:58,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:45:58,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:45:58,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-10-21 19:45:58,367 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:45:58,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:45:58,368 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:45:58,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-10-21 19:45:58,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:45:58,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:45:58,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:45:58,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:45:58,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:45:58,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:45:58,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:45:58,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:45:58,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:45:58,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-10-21 19:45:58,428 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:45:58,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:45:58,429 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:45:58,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:45:58,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:45:58,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:45:58,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:45:58,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:45:58,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:45:58,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:45:58,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-10-21 19:45:58,483 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-21 19:45:58,546 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-10-21 19:45:58,546 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-10-21 19:45:58,548 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:45:58,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:45:58,550 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:45:58,567 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-21 19:45:58,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-10-21 19:45:58,592 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-21 19:45:58,592 INFO L513 LassoAnalysis]: Proved termination. [2021-10-21 19:45:58,593 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2021-10-21 19:45:58,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-10-21 19:45:58,638 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-10-21 19:45:58,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:45:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:45:58,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-21 19:45:58,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:45:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:45:58,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-21 19:45:58,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:45:58,733 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-21 19:45:58,751 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-10-21 19:45:58,753 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 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, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 19:45:58,807 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 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, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Result 65 states and 99 transitions. Complement of second has 7 states. [2021-10-21 19:45:58,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-10-21 19:45:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 19:45:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2021-10-21 19:45:58,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2021-10-21 19:45:58,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:45:58,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2021-10-21 19:45:58,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:45:58,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 4 letters. [2021-10-21 19:45:58,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:45:58,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 99 transitions. [2021-10-21 19:45:58,819 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-10-21 19:45:58,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 21 states and 30 transitions. [2021-10-21 19:45:58,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-10-21 19:45:58,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-10-21 19:45:58,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2021-10-21 19:45:58,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:45:58,824 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-10-21 19:45:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2021-10-21 19:45:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-10-21 19:45:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:45:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2021-10-21 19:45:58,849 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-10-21 19:45:58,850 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-10-21 19:45:58,850 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-21 19:45:58,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2021-10-21 19:45:58,851 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-10-21 19:45:58,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:45:58,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:45:58,851 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-10-21 19:45:58,851 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-21 19:45:58,852 INFO L791 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 152#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 160#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 156#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 147#L535-3 assume !(main_~i~1 < main_~array_size~0); 149#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 162#L517-3 [2021-10-21 19:45:58,852 INFO L793 eck$LassoCheckResult]: Loop: 162#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 161#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 162#L517-3 [2021-10-21 19:45:58,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:45:58,852 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-10-21 19:45:58,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:45:58,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829456969] [2021-10-21 19:45:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:45:58,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:45:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:45:58,909 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-21 19:45:58,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:45:58,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829456969] [2021-10-21 19:45:58,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829456969] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:45:58,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:45:58,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:45:58,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827542650] [2021-10-21 19:45:58,913 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:45:58,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:45:58,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2021-10-21 19:45:58,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:45:58,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652274550] [2021-10-21 19:45:58,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:45:58,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:45:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:58,923 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:45:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:58,933 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:45:59,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:45:59,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:45:59,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:45:59,031 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-21 19:45:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:45:59,063 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2021-10-21 19:45:59,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:45:59,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2021-10-21 19:45:59,065 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-10-21 19:45:59,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2021-10-21 19:45:59,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-10-21 19:45:59,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-10-21 19:45:59,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-10-21 19:45:59,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:45:59,067 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-10-21 19:45:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-10-21 19:45:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-10-21 19:45:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 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-21 19:45:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2021-10-21 19:45:59,070 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-10-21 19:45:59,070 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-10-21 19:45:59,070 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-21 19:45:59,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2021-10-21 19:45:59,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-10-21 19:45:59,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:45:59,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:45:59,072 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:45:59,072 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-21 19:45:59,072 INFO L791 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 202#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 210#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 206#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 197#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 198#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 199#L535-3 assume !(main_~i~1 < main_~array_size~0); 200#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 212#L517-3 [2021-10-21 19:45:59,072 INFO L793 eck$LassoCheckResult]: Loop: 212#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 211#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 212#L517-3 [2021-10-21 19:45:59,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:45:59,073 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-10-21 19:45:59,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:45:59,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267336473] [2021-10-21 19:45:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:45:59,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:45:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:59,093 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:45:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:59,116 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:45:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:45:59,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2021-10-21 19:45:59,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:45:59,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215338051] [2021-10-21 19:45:59,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:45:59,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:45:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:59,125 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:45:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:59,133 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:45:59,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:45:59,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2021-10-21 19:45:59,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:45:59,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861510879] [2021-10-21 19:45:59,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:45:59,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:45:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:59,158 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:45:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:45:59,185 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:45:59,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:00,027 INFO L210 LassoAnalysis]: Preferences: [2021-10-21 19:46:00,027 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-21 19:46:00,027 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-21 19:46:00,027 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-21 19:46:00,027 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-21 19:46:00,027 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:00,027 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-21 19:46:00,027 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-21 19:46:00,028 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2021-10-21 19:46:00,028 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-21 19:46:00,028 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-21 19:46:00,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:00,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:01,114 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-21 19:46:01,114 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-21 19:46:01,114 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:01,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:01,116 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:01,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-10-21 19:46:01,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:46:01,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:46:01,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:46:01,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:46:01,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:46:01,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:46:01,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:46:01,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:46:01,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:46:01,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:01,186 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:01,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:01,187 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:01,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:46:01,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:46:01,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:46:01,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:46:01,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:46:01,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:46:01,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:46:01,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-10-21 19:46:01,222 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:46:01,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:01,258 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:01,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:01,260 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:01,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:46:01,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:46:01,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:46:01,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:46:01,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:46:01,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:46:01,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:46:01,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:46:01,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-10-21 19:46:01,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:46:01,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:01,330 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:01,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:01,335 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:01,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:46:01,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:46:01,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:46:01,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:46:01,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:46:01,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:46:01,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-10-21 19:46:01,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:46:01,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:46:01,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:46:01,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:01,388 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:01,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:01,389 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:01,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-10-21 19:46:01,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:46:01,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:46:01,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:46:01,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:46:01,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:46:01,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:46:01,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:46:01,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:46:01,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:01,449 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:01,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:01,450 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:01,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:46:01,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:46:01,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:46:01,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:46:01,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:46:01,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:46:01,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:46:01,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:46:01,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-10-21 19:46:01,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:46:01,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:01,500 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:01,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:01,501 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:01,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-10-21 19:46:01,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:46:01,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:46:01,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:46:01,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:46:01,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:46:01,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:46:01,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:46:01,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:46:01,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:46:01,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:01,530 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:01,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:01,533 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:01,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-10-21 19:46:01,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:46:01,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:46:01,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:46:01,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:46:01,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:46:01,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:46:01,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:46:01,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:46:01,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:01,577 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:01,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:01,577 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:01,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-10-21 19:46:01,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:46:01,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:46:01,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:46:01,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:46:01,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:46:01,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:46:01,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:46:01,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-21 19:46:01,690 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-10-21 19:46:01,690 INFO L444 ModelExtractionUtils]: 28 out of 61 variables were initially zero. Simplification set additionally 30 variables to zero. [2021-10-21 19:46:01,691 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:01,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:01,695 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:01,712 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-21 19:46:01,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-10-21 19:46:01,737 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-21 19:46:01,738 INFO L513 LassoAnalysis]: Proved termination. [2021-10-21 19:46:01,738 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2021-10-21 19:46:01,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:01,833 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2021-10-21 19:46:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:01,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-21 19:46:01,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:46:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:01,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-21 19:46:01,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:46:01,919 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-21 19:46:01,921 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-10-21 19:46:01,921 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:46:01,941 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 35 transitions. Complement of second has 7 states. [2021-10-21 19:46:01,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-10-21 19:46:01,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:46:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-10-21 19:46:01,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2021-10-21 19:46:01,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:46:01,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2021-10-21 19:46:01,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:46:01,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2021-10-21 19:46:01,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:46:01,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-10-21 19:46:01,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-10-21 19:46:01,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2021-10-21 19:46:01,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-10-21 19:46:01,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-10-21 19:46:01,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2021-10-21 19:46:01,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:46:01,956 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-10-21 19:46:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2021-10-21 19:46:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-10-21 19:46:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:46:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-10-21 19:46:01,962 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-10-21 19:46:01,962 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-10-21 19:46:01,962 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-21 19:46:01,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2021-10-21 19:46:01,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-10-21 19:46:01,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:46:01,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:46:01,965 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:46:01,966 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-21 19:46:01,967 INFO L791 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 385#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 393#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 389#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 380#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 381#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 382#L535-3 assume !(main_~i~1 < main_~array_size~0); 383#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 400#L517-3 assume !(lis_~i~0 < lis_~N); 401#L517-4 lis_~i~0 := 1; 392#L519-3 [2021-10-21 19:46:01,967 INFO L793 eck$LassoCheckResult]: Loop: 392#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 386#L520-3 assume !(lis_~j~0 < lis_~i~0); 387#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 392#L519-3 [2021-10-21 19:46:01,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:01,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2021-10-21 19:46:01,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:01,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297667114] [2021-10-21 19:46:01,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:01,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:46:02,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:46:02,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297667114] [2021-10-21 19:46:02,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297667114] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:46:02,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:46:02,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:46:02,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601756945] [2021-10-21 19:46:02,066 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:46:02,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:02,066 INFO L82 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2021-10-21 19:46:02,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:02,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651748522] [2021-10-21 19:46:02,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:02,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:02,070 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:46:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:02,073 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:46:02,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:02,105 INFO L210 LassoAnalysis]: Preferences: [2021-10-21 19:46:02,106 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-21 19:46:02,106 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-21 19:46:02,106 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-21 19:46:02,106 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-10-21 19:46:02,106 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:02,106 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-21 19:46:02,106 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-21 19:46:02,106 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-10-21 19:46:02,107 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-21 19:46:02,107 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-21 19:46:02,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:02,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:02,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:02,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:02,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:02,162 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-21 19:46:02,163 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-10-21 19:46:02,165 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:02,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:02,166 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:02,168 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-21 19:46:02,168 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-21 19:46:02,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-10-21 19:46:02,200 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-10-21 19:46:02,200 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_3=1} Honda state: {v_rep~unnamed0~0~P_PID_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-10-21 19:46:02,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:02,232 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:02,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:02,235 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:02,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-21 19:46:02,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-21 19:46:02,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-10-21 19:46:02,270 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-10-21 19:46:02,270 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_3=2} Honda state: {v_rep~unnamed0~0~P_PGID_3=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-10-21 19:46:02,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:02,306 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:02,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:02,307 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:02,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-21 19:46:02,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-21 19:46:02,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-10-21 19:46:02,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:02,396 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:02,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:02,397 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:02,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-10-21 19:46:02,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-21 19:46:02,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-10-21 19:46:02,539 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-10-21 19:46:02,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:02,542 INFO L210 LassoAnalysis]: Preferences: [2021-10-21 19:46:02,542 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-21 19:46:02,542 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-21 19:46:02,542 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-21 19:46:02,542 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-21 19:46:02,542 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:02,542 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-21 19:46:02,543 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-21 19:46:02,543 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-10-21 19:46:02,543 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-21 19:46:02,543 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-21 19:46:02,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:02,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:02,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:02,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:02,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:02,617 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-21 19:46:02,617 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-21 19:46:02,618 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:02,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:02,618 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:02,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-10-21 19:46:02,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:46:02,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:46:02,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:46:02,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:46:02,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:46:02,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:46:02,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:46:02,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:46:02,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:02,682 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:02,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:02,682 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:02,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-10-21 19:46:02,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:46:02,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:46:02,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:46:02,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:46:02,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:46:02,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:46:02,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:46:02,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:46:02,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-10-21 19:46:02,717 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:02,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:02,718 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:02,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-10-21 19:46:02,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:46:02,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:46:02,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:46:02,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:46:02,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:46:02,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:46:02,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:46:02,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:46:02,740 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-21 19:46:02,746 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-10-21 19:46:02,746 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-10-21 19:46:02,746 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:02,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:02,747 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:46:02,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-10-21 19:46:02,749 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-21 19:46:02,749 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-10-21 19:46:02,749 INFO L513 LassoAnalysis]: Proved termination. [2021-10-21 19:46:02,749 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2021-10-21 19:46:02,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-10-21 19:46:02,768 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-10-21 19:46:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:02,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-21 19:46:02,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:46:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:02,843 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-21 19:46:02,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:46:02,876 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-21 19:46:02,876 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-10-21 19:46:02,877 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:46:02,936 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 67 transitions. Complement of second has 9 states. [2021-10-21 19:46:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-10-21 19:46:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:46:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-10-21 19:46:02,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2021-10-21 19:46:02,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:46:02,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2021-10-21 19:46:02,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:46:02,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2021-10-21 19:46:02,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:46:02,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2021-10-21 19:46:02,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2021-10-21 19:46:02,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2021-10-21 19:46:02,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-10-21 19:46:02,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-10-21 19:46:02,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2021-10-21 19:46:02,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:46:02,941 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 62 transitions. [2021-10-21 19:46:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2021-10-21 19:46:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2021-10-21 19:46:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 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-21 19:46:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2021-10-21 19:46:02,945 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2021-10-21 19:46:02,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:46:02,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:46:02,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:46:02,946 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-21 19:46:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:46:02,998 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2021-10-21 19:46:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:46:02,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2021-10-21 19:46:02,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:46:03,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2021-10-21 19:46:03,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-21 19:46:03,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-21 19:46:03,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2021-10-21 19:46:03,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:46:03,000 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2021-10-21 19:46:03,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2021-10-21 19:46:03,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-10-21 19:46:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 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-21 19:46:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2021-10-21 19:46:03,002 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-10-21 19:46:03,002 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-10-21 19:46:03,002 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-21 19:46:03,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2021-10-21 19:46:03,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:46:03,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:46:03,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:46:03,003 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:46:03,003 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:46:03,004 INFO L791 eck$LassoCheckResult]: Stem: 586#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 587#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 601#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 593#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 582#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 583#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 584#L535-3 assume !(main_~i~1 < main_~array_size~0); 585#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 610#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 602#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 603#L517-3 assume !(lis_~i~0 < lis_~N); 611#L517-4 lis_~i~0 := 1; 612#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 588#L520-3 [2021-10-21 19:46:03,004 INFO L793 eck$LassoCheckResult]: Loop: 588#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 589#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 594#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 595#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 606#L520-3 assume !(lis_~j~0 < lis_~i~0); 598#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 599#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 588#L520-3 [2021-10-21 19:46:03,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:03,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2021-10-21 19:46:03,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:03,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911365237] [2021-10-21 19:46:03,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:03,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:46:03,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:46:03,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911365237] [2021-10-21 19:46:03,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911365237] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:46:03,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371817240] [2021-10-21 19:46:03,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:03,052 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:46:03,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:03,053 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:46:03,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-10-21 19:46:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:03,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-21 19:46:03,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:46:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:46:03,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371817240] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:46:03,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:46:03,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2021-10-21 19:46:03,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913726251] [2021-10-21 19:46:03,203 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:46:03,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:03,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2021-10-21 19:46:03,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:03,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982877655] [2021-10-21 19:46:03,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:03,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:03,225 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:46:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:03,252 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:46:03,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:46:03,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:46:03,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:46:03,438 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 21 Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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-21 19:46:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:46:03,633 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2021-10-21 19:46:03,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 19:46:03,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 109 transitions. [2021-10-21 19:46:03,635 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-10-21 19:46:03,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 81 transitions. [2021-10-21 19:46:03,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-10-21 19:46:03,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-10-21 19:46:03,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 81 transitions. [2021-10-21 19:46:03,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:46:03,637 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 81 transitions. [2021-10-21 19:46:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 81 transitions. [2021-10-21 19:46:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2021-10-21 19:46:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 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-21 19:46:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2021-10-21 19:46:03,640 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2021-10-21 19:46:03,640 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2021-10-21 19:46:03,640 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-21 19:46:03,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2021-10-21 19:46:03,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:46:03,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:46:03,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:46:03,642 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:46:03,642 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:46:03,642 INFO L791 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 762#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 776#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 768#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 757#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 758#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 759#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 760#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 791#L535-3 assume !(main_~i~1 < main_~array_size~0); 785#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 786#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 789#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 790#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 777#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 778#L517-3 assume !(lis_~i~0 < lis_~N); 787#L517-4 lis_~i~0 := 1; 779#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 763#L520-3 [2021-10-21 19:46:03,642 INFO L793 eck$LassoCheckResult]: Loop: 763#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 764#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 769#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 770#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 781#L520-3 assume !(lis_~j~0 < lis_~i~0); 773#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 774#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 763#L520-3 [2021-10-21 19:46:03,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:03,642 INFO L82 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2021-10-21 19:46:03,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:03,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402218154] [2021-10-21 19:46:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:03,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:03,698 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:46:03,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:03,746 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:46:03,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:03,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2021-10-21 19:46:03,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:03,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815368744] [2021-10-21 19:46:03,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:03,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:03,763 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:46:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:03,787 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:46:03,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:03,787 INFO L82 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2021-10-21 19:46:03,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:03,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229251043] [2021-10-21 19:46:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:03,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-21 19:46:03,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:46:03,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229251043] [2021-10-21 19:46:03,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229251043] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:46:03,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60791828] [2021-10-21 19:46:03,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:03,876 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:46:03,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:03,879 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:46:03,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-10-21 19:46:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:03,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-21 19:46:03,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:46:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-21 19:46:04,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60791828] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:46:04,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:46:04,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-10-21 19:46:04,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991922857] [2021-10-21 19:46:04,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:46:04,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:46:04,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:46:04,277 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 19 Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 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-21 19:46:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:46:04,433 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2021-10-21 19:46:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:46:04,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 92 transitions. [2021-10-21 19:46:04,434 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2021-10-21 19:46:04,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 83 transitions. [2021-10-21 19:46:04,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-10-21 19:46:04,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-10-21 19:46:04,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 83 transitions. [2021-10-21 19:46:04,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:46:04,436 INFO L681 BuchiCegarLoop]: Abstraction has 62 states and 83 transitions. [2021-10-21 19:46:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 83 transitions. [2021-10-21 19:46:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2021-10-21 19:46:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 54 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:46:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2021-10-21 19:46:04,440 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-10-21 19:46:04,441 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-10-21 19:46:04,441 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-21 19:46:04,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2021-10-21 19:46:04,441 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-10-21 19:46:04,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:46:04,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:46:04,442 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:46:04,442 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:46:04,442 INFO L791 eck$LassoCheckResult]: Stem: 962#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 963#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 977#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 969#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 958#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 959#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 960#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 961#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1006#L535-3 assume !(main_~i~1 < main_~array_size~0); 988#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 989#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 978#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 979#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 992#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 996#L517-3 assume !(lis_~i~0 < lis_~N); 990#L517-4 lis_~i~0 := 1; 991#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1000#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 984#L521 [2021-10-21 19:46:04,442 INFO L793 eck$LassoCheckResult]: Loop: 984#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 970#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 971#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 983#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 984#L521 [2021-10-21 19:46:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1159051365, now seen corresponding path program 1 times [2021-10-21 19:46:04,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:04,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423735507] [2021-10-21 19:46:04,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:04,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:04,485 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:46:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:04,532 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:46:04,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:04,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2655420, now seen corresponding path program 1 times [2021-10-21 19:46:04,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:04,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548576816] [2021-10-21 19:46:04,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:04,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:04,543 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:46:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:04,548 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:46:04,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:04,549 INFO L82 PathProgramCache]: Analyzing trace with hash -651990240, now seen corresponding path program 1 times [2021-10-21 19:46:04,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:04,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734345837] [2021-10-21 19:46:04,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:04,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 19:46:04,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:46:04,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734345837] [2021-10-21 19:46:04,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734345837] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:46:04,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307836231] [2021-10-21 19:46:04,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:04,594 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:46:04,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:04,595 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:46:04,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-10-21 19:46:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:04,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-21 19:46:04,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:46:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 19:46:04,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307836231] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:46:04,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-21 19:46:04,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-10-21 19:46:04,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569136761] [2021-10-21 19:46:05,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:46:05,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:46:05,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:46:05,003 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. cyclomatic complexity: 27 Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-21 19:46:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:46:05,055 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2021-10-21 19:46:05,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:46:05,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2021-10-21 19:46:05,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:46:05,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2021-10-21 19:46:05,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-10-21 19:46:05,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-10-21 19:46:05,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2021-10-21 19:46:05,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:46:05,058 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 97 transitions. [2021-10-21 19:46:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2021-10-21 19:46:05,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2021-10-21 19:46:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.375) internal successors, (88), 63 states have internal predecessors, (88), 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-21 19:46:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2021-10-21 19:46:05,063 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2021-10-21 19:46:05,063 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2021-10-21 19:46:05,063 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-21 19:46:05,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 88 transitions. [2021-10-21 19:46:05,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:46:05,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:46:05,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:46:05,064 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:46:05,064 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-21 19:46:05,065 INFO L791 eck$LassoCheckResult]: Stem: 1165#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1166#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1178#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1171#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1161#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1162#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1163#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1164#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1214#L535-3 assume !(main_~i~1 < main_~array_size~0); 1213#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1198#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1179#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1180#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1199#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1218#L517-3 assume !(lis_~i~0 < lis_~N); 1196#L517-4 lis_~i~0 := 1; 1184#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1185#L520-3 assume !(lis_~j~0 < lis_~i~0); 1221#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1200#L519-3 assume !(lis_~i~0 < lis_~N); 1197#L519-4 lis_~i~0 := 0; 1191#L523-3 [2021-10-21 19:46:05,065 INFO L793 eck$LassoCheckResult]: Loop: 1191#L523-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 1192#L524 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 1193#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1191#L523-3 [2021-10-21 19:46:05,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:05,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2057131266, now seen corresponding path program 1 times [2021-10-21 19:46:05,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:05,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582302938] [2021-10-21 19:46:05,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:05,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 19:46:05,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:46:05,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582302938] [2021-10-21 19:46:05,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582302938] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:46:05,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:46:05,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:46:05,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205364787] [2021-10-21 19:46:05,098 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:46:05,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:05,098 INFO L82 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2021-10-21 19:46:05,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:05,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935880717] [2021-10-21 19:46:05,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:05,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:05,103 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:46:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:05,106 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:46:05,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:46:05,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:46:05,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:46:05,148 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. cyclomatic complexity: 30 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:46:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:46:05,182 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2021-10-21 19:46:05,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:46:05,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2021-10-21 19:46:05,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:46:05,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 88 transitions. [2021-10-21 19:46:05,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-10-21 19:46:05,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-10-21 19:46:05,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 88 transitions. [2021-10-21 19:46:05,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:46:05,185 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 88 transitions. [2021-10-21 19:46:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 88 transitions. [2021-10-21 19:46:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2021-10-21 19:46:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.34375) internal successors, (86), 63 states have internal predecessors, (86), 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-21 19:46:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2021-10-21 19:46:05,189 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2021-10-21 19:46:05,189 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2021-10-21 19:46:05,190 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-21 19:46:05,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 86 transitions. [2021-10-21 19:46:05,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-21 19:46:05,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:46:05,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:46:05,191 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:46:05,191 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:46:05,192 INFO L791 eck$LassoCheckResult]: Stem: 1303#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1304#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1317#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1309#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1299#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1300#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1301#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1302#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1349#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1350#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1351#L535-3 assume !(main_~i~1 < main_~array_size~0); 1348#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1347#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1346#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1345#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1343#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1342#L517-3 assume !(lis_~i~0 < lis_~N); 1341#L517-4 lis_~i~0 := 1; 1339#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1340#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1326#L521 assume !lis_#t~short11; 1310#L521-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1311#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1305#L520-3 assume !(lis_~j~0 < lis_~i~0); 1306#L519-2 [2021-10-21 19:46:05,192 INFO L793 eck$LassoCheckResult]: Loop: 1306#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1314#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1336#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1355#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1357#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1356#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1354#L520-3 assume !(lis_~j~0 < lis_~i~0); 1306#L519-2 [2021-10-21 19:46:05,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:05,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1034472260, now seen corresponding path program 1 times [2021-10-21 19:46:05,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:05,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144974584] [2021-10-21 19:46:05,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:05,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-21 19:46:05,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:46:05,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144974584] [2021-10-21 19:46:05,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144974584] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:46:05,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:46:05,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:46:05,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690298173] [2021-10-21 19:46:05,218 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:46:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:05,218 INFO L82 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 3 times [2021-10-21 19:46:05,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:05,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227702490] [2021-10-21 19:46:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:05,219 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:05,224 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:46:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:05,229 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:46:05,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:46:05,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:46:05,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:46:05,418 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-21 19:46:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:46:05,428 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2021-10-21 19:46:05,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:46:05,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2021-10-21 19:46:05,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-10-21 19:46:05,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2021-10-21 19:46:05,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-10-21 19:46:05,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-10-21 19:46:05,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2021-10-21 19:46:05,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:46:05,431 INFO L681 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-10-21 19:46:05,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2021-10-21 19:46:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-10-21 19:46:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.318840579710145) internal successors, (91), 68 states have internal predecessors, (91), 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-21 19:46:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2021-10-21 19:46:05,435 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-10-21 19:46:05,435 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-10-21 19:46:05,436 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-21 19:46:05,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2021-10-21 19:46:05,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-10-21 19:46:05,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:46:05,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:46:05,437 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:46:05,437 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:46:05,438 INFO L791 eck$LassoCheckResult]: Stem: 1443#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1444#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1458#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1449#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1438#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1439#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1497#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1496#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1495#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1441#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1440#L535-3 assume !(main_~i~1 < main_~array_size~0); 1442#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1475#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1479#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1480#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1459#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1460#L517-3 assume !(lis_~i~0 < lis_~N); 1476#L517-4 lis_~i~0 := 1; 1477#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1445#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1446#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1506#L521-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1461#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1462#L520-3 assume !(lis_~j~0 < lis_~i~0); 1454#L519-2 [2021-10-21 19:46:05,438 INFO L793 eck$LassoCheckResult]: Loop: 1454#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1455#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1481#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1499#L521 assume !lis_#t~short11; 1501#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1500#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1498#L520-3 assume !(lis_~j~0 < lis_~i~0); 1454#L519-2 [2021-10-21 19:46:05,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:05,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2021-10-21 19:46:05,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:05,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723785432] [2021-10-21 19:46:05,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:05,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:46:05,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:46:05,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723785432] [2021-10-21 19:46:05,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723785432] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:46:05,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206231410] [2021-10-21 19:46:05,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:05,559 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:46:05,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:46:05,567 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:46:05,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-10-21 19:46:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:46:05,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-21 19:46:05,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:46:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:46:05,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206231410] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:46:05,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:46:05,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-10-21 19:46:05,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650134382] [2021-10-21 19:46:05,832 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:46:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:05,833 INFO L82 PathProgramCache]: Analyzing trace with hash 782608452, now seen corresponding path program 1 times [2021-10-21 19:46:05,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:05,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169486939] [2021-10-21 19:46:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:05,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:05,838 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:46:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:05,843 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:46:05,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:46:05,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-21 19:46:05,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:46:05,976 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. cyclomatic complexity: 28 Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 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-21 19:46:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:46:06,241 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2021-10-21 19:46:06,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:46:06,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 99 transitions. [2021-10-21 19:46:06,243 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-10-21 19:46:06,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 99 transitions. [2021-10-21 19:46:06,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-10-21 19:46:06,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-10-21 19:46:06,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 99 transitions. [2021-10-21 19:46:06,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:46:06,244 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 99 transitions. [2021-10-21 19:46:06,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 99 transitions. [2021-10-21 19:46:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2021-10-21 19:46:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:46:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2021-10-21 19:46:06,248 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-21 19:46:06,248 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-21 19:46:06,248 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-21 19:46:06,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2021-10-21 19:46:06,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-10-21 19:46:06,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:46:06,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:46:06,250 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:46:06,250 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-21 19:46:06,250 INFO L791 eck$LassoCheckResult]: Stem: 1687#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1688#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1702#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1693#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1683#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1684#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1685#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1686#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1725#L535-3 assume !(main_~i~1 < main_~array_size~0); 1727#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1741#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1740#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1739#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1737#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1736#L517-3 assume !(lis_~i~0 < lis_~N); 1719#L517-4 lis_~i~0 := 1; 1705#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1706#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1749#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1747#L521-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1746#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1723#L520-3 assume !(lis_~j~0 < lis_~i~0); 1724#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1743#L519-3 assume !(lis_~i~0 < lis_~N); 1720#L519-4 lis_~i~0 := 0; 1711#L523-3 [2021-10-21 19:46:06,250 INFO L793 eck$LassoCheckResult]: Loop: 1711#L523-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 1712#L524 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 1716#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1711#L523-3 [2021-10-21 19:46:06,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:06,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2021-10-21 19:46:06,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:06,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543324226] [2021-10-21 19:46:06,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:06,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:06,278 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:46:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:06,302 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:46:06,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:06,303 INFO L82 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 2 times [2021-10-21 19:46:06,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:06,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909980390] [2021-10-21 19:46:06,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:06,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:06,308 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:46:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:06,311 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:46:06,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:46:06,312 INFO L82 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2021-10-21 19:46:06,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:46:06,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019865734] [2021-10-21 19:46:06,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:46:06,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:46:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:06,346 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:46:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:46:06,388 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:46:11,707 INFO L210 LassoAnalysis]: Preferences: [2021-10-21 19:46:11,707 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-21 19:46:11,707 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-21 19:46:11,707 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-21 19:46:11,707 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-21 19:46:11,707 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:46:11,708 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-21 19:46:11,708 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-21 19:46:11,708 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration11_Lasso [2021-10-21 19:46:11,708 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-21 19:46:11,708 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-21 19:46:11,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:11,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:46:12,337 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:109) 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:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) 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-10-21 19:46:12,340 INFO L168 Benchmark]: Toolchain (without parser) took 16290.08 ms. Allocated memory was 102.8 MB in the beginning and 195.0 MB in the end (delta: 92.3 MB). Free memory was 67.8 MB in the beginning and 81.9 MB in the end (delta: -14.1 MB). Peak memory consumption was 103.7 MB. Max. memory is 16.1 GB. [2021-10-21 19:46:12,341 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 102.8 MB. Free memory was 56.1 MB in the beginning and 56.0 MB in the end (delta: 42.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:46:12,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.92 ms. Allocated memory is still 102.8 MB. Free memory was 67.6 MB in the beginning and 71.1 MB in the end (delta: -3.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:46:12,342 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.85 ms. Allocated memory is still 102.8 MB. Free memory was 71.1 MB in the beginning and 69.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:46:12,342 INFO L168 Benchmark]: Boogie Preprocessor took 29.98 ms. Allocated memory is still 102.8 MB. Free memory was 69.0 MB in the beginning and 67.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:46:12,342 INFO L168 Benchmark]: RCFGBuilder took 448.45 ms. Allocated memory is still 102.8 MB. Free memory was 67.6 MB in the beginning and 55.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-21 19:46:12,343 INFO L168 Benchmark]: BuchiAutomizer took 15321.25 ms. Allocated memory was 102.8 MB in the beginning and 195.0 MB in the end (delta: 92.3 MB). Free memory was 55.3 MB in the beginning and 81.9 MB in the end (delta: -26.6 MB). Peak memory consumption was 93.6 MB. Max. memory is 16.1 GB. [2021-10-21 19:46:12,344 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.24 ms. Allocated memory is still 102.8 MB. Free memory was 56.1 MB in the beginning and 56.0 MB in the end (delta: 42.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 434.92 ms. Allocated memory is still 102.8 MB. Free memory was 67.6 MB in the beginning and 71.1 MB in the end (delta: -3.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.85 ms. Allocated memory is still 102.8 MB. Free memory was 71.1 MB in the beginning and 69.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.98 ms. Allocated memory is still 102.8 MB. Free memory was 69.0 MB in the beginning and 67.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 448.45 ms. Allocated memory is still 102.8 MB. Free memory was 67.6 MB in the beginning and 55.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 15321.25 ms. Allocated memory was 102.8 MB in the beginning and 195.0 MB in the end (delta: 92.3 MB). Free memory was 55.3 MB in the beginning and 81.9 MB in the end (delta: -26.6 MB). Peak memory consumption was 93.6 MB. Max. memory is 16.1 GB. * 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-10-21 19:46:12,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:12,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-10-21 19:46:12,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:13,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-10-21 19:46:13,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0213a05b-eadb-432d-8357-c0d65679497a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...