./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 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY --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 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 07:55:45,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 07:55:45,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 07:55:45,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 07:55:45,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 07:55:45,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 07:55:45,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 07:55:45,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 07:55:45,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 07:55:45,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 07:55:45,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 07:55:45,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 07:55:45,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 07:55:45,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 07:55:45,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 07:55:45,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 07:55:45,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 07:55:45,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 07:55:45,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 07:55:45,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 07:55:45,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 07:55:45,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 07:55:45,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 07:55:45,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 07:55:45,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 07:55:45,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 07:55:45,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 07:55:45,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 07:55:45,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 07:55:45,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 07:55:45,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 07:55:45,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 07:55:45,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 07:55:45,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 07:55:45,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 07:55:45,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 07:55:45,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 07:55:45,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 07:55:45,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 07:55:45,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 07:55:45,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 07:55:45,658 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-07 07:55:45,690 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 07:55:45,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 07:55:45,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 07:55:45,692 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 07:55:45,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 07:55:45,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 07:55:45,694 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 07:55:45,694 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-07 07:55:45,695 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-07 07:55:45,695 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-07 07:55:45,695 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-07 07:55:45,696 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-07 07:55:45,696 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-07 07:55:45,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 07:55:45,697 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 07:55:45,697 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 07:55:45,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 07:55:45,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 07:55:45,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 07:55:45,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-07 07:55:45,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-07 07:55:45,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-07 07:55:45,700 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 07:55:45,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 07:55:45,700 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-07 07:55:45,701 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 07:55:45,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-07 07:55:45,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 07:55:45,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 07:55:45,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 07:55:45,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 07:55:45,703 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 07:55:45,704 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-07 07:55:45,705 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_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/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_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY 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-11-07 07:55:46,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 07:55:46,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 07:55:46,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 07:55:46,058 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 07:55:46,059 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 07:55:46,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-11-07 07:55:46,158 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/data/9496c8a16/82dc45a6a3364dc38c2e899e382aba2d/FLAGc6588e888 [2021-11-07 07:55:46,848 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 07:55:46,856 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-11-07 07:55:46,882 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/data/9496c8a16/82dc45a6a3364dc38c2e899e382aba2d/FLAGc6588e888 [2021-11-07 07:55:47,072 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/data/9496c8a16/82dc45a6a3364dc38c2e899e382aba2d [2021-11-07 07:55:47,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 07:55:47,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 07:55:47,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 07:55:47,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 07:55:47,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 07:55:47,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:55:47" (1/1) ... [2021-11-07 07:55:47,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be06278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:47, skipping insertion in model container [2021-11-07 07:55:47,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:55:47" (1/1) ... [2021-11-07 07:55:47,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 07:55:47,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 07:55:47,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:55:47,625 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 07:55:47,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:55:47,747 INFO L208 MainTranslator]: Completed translation [2021-11-07 07:55:47,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:47 WrapperNode [2021-11-07 07:55:47,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 07:55:47,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 07:55:47,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 07:55:47,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 07:55:47,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:47" (1/1) ... [2021-11-07 07:55:47,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:47" (1/1) ... [2021-11-07 07:55:47,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 07:55:47,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 07:55:47,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 07:55:47,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 07:55:47,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:47" (1/1) ... [2021-11-07 07:55:47,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:47" (1/1) ... [2021-11-07 07:55:47,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:47" (1/1) ... [2021-11-07 07:55:47,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:47" (1/1) ... [2021-11-07 07:55:47,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:47" (1/1) ... [2021-11-07 07:55:47,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:47" (1/1) ... [2021-11-07 07:55:47,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:47" (1/1) ... [2021-11-07 07:55:47,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 07:55:47,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 07:55:47,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 07:55:47,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 07:55:47,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:47" (1/1) ... [2021-11-07 07:55:47,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:47,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:47,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:47,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-07 07:55:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 07:55:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 07:55:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 07:55:47,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 07:55:47,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 07:55:47,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 07:55:48,335 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 07:55:48,336 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-11-07 07:55:48,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:55:48 BoogieIcfgContainer [2021-11-07 07:55:48,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 07:55:48,340 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-07 07:55:48,340 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-07 07:55:48,344 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-07 07:55:48,345 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 07:55:48,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 07:55:47" (1/3) ... [2021-11-07 07:55:48,347 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57002345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 07:55:48, skipping insertion in model container [2021-11-07 07:55:48,347 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 07:55:48,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:55:47" (2/3) ... [2021-11-07 07:55:48,348 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57002345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 07:55:48, skipping insertion in model container [2021-11-07 07:55:48,348 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 07:55:48,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:55:48" (3/3) ... [2021-11-07 07:55:48,350 INFO L389 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2021-11-07 07:55:48,402 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-07 07:55:48,402 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-07 07:55:48,403 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-07 07:55:48,403 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-07 07:55:48,403 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-07 07:55:48,403 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-07 07:55:48,403 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-07 07:55:48,404 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-07 07:55:48,422 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-11-07 07:55:48,447 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-11-07 07:55:48,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:55:48,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:55:48,454 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-11-07 07:55:48,455 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:55:48,455 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-07 07:55:48,456 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-11-07 07:55:48,460 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-11-07 07:55:48,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:55:48,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:55:48,461 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-11-07 07:55:48,461 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:55:48,469 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 % 4294967296 >= 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-11-07 07:55:48,470 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-11-07 07:55:48,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-11-07 07:55:48,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:48,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103275678] [2021-11-07 07:55:48,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:48,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:48,623 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:48,687 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:48,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-11-07 07:55:48,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:48,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23560565] [2021-11-07 07:55:48,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:48,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:48,735 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:48,755 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:48,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:48,762 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-11-07 07:55:48,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:48,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507833026] [2021-11-07 07:55:48,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:48,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:48,819 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:48,849 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:49,200 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 07:55:49,201 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 07:55:49,201 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 07:55:49,201 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 07:55:49,201 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-07 07:55:49,201 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:49,202 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 07:55:49,202 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 07:55:49,202 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2021-11-07 07:55:49,202 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 07:55:49,203 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 07:55:49,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:49,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:49,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:49,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:49,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:49,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:49,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:49,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:49,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:49,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:49,709 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 07:55:49,714 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-07 07:55:49,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:49,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:49,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:49,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-07 07:55:49,721 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-11-07 07:55:49,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:49,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:55:49,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:49,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:49,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:49,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:55:49,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:55:49,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:49,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-11-07 07:55:49,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:49,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:49,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:49,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-07 07:55:49,777 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-11-07 07:55:49,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:49,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:55:49,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:49,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:49,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:49,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:55:49,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:55:49,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:49,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:49,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:49,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:49,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:49,856 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-11-07 07:55:49,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:49,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:49,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:49,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:49,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:55:49,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:55:49,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-07 07:55:49,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:49,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:49,938 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:49,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:49,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:49,946 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-11-07 07:55:49,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-07 07:55:49,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:49,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:55:49,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:49,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:49,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:49,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:55:49,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:55:49,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:50,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:50,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:50,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:50,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:50,023 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-11-07 07:55:50,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:50,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:50,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:50,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:50,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:55:50,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:55:50,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-07 07:55:50,070 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-07 07:55:50,109 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-11-07 07:55:50,110 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-11-07 07:55:50,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:50,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:50,114 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:50,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-07 07:55:50,135 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-07 07:55:50,157 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-07 07:55:50,158 INFO L513 LassoAnalysis]: Proved termination. [2021-11-07 07:55:50,158 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-11-07 07:55:50,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:50,210 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-11-07 07:55:50,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:50,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 07:55:50,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:55:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:50,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 07:55:50,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:55:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:55:50,384 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-11-07 07:55:50,400 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-11-07 07:55:50,467 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-11-07 07:55:50,468 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-11-07 07:55:50,470 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-11-07 07:55:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2021-11-07 07:55:50,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2021-11-07 07:55:50,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 07:55:50,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2021-11-07 07:55:50,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 07:55:50,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 4 letters. [2021-11-07 07:55:50,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 07:55:50,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 99 transitions. [2021-11-07 07:55:50,482 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-11-07 07:55:50,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 21 states and 30 transitions. [2021-11-07 07:55:50,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-11-07 07:55:50,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-11-07 07:55:50,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2021-11-07 07:55:50,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:55:50,489 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-11-07 07:55:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2021-11-07 07:55:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-11-07 07:55:50,518 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-11-07 07:55:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2021-11-07 07:55:50,520 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-11-07 07:55:50,521 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-11-07 07:55:50,521 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-07 07:55:50,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2021-11-07 07:55:50,522 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-11-07 07:55:50,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:55:50,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:55:50,523 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-11-07 07:55:50,523 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:55:50,523 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 % 4294967296 >= 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-11-07 07:55:50,524 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-11-07 07:55:50,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:50,524 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-11-07 07:55:50,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:50,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552496492] [2021-11-07 07:55:50,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:50,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:55:50,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:55:50,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552496492] [2021-11-07 07:55:50,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552496492] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:55:50,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:55:50,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:55:50,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323080518] [2021-11-07 07:55:50,650 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:55:50,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:50,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2021-11-07 07:55:50,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:50,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974484356] [2021-11-07 07:55:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:50,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:50,670 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:50,693 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:50,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:55:50,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:55:50,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:55:50,819 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-11-07 07:55:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:55:50,860 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2021-11-07 07:55:50,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:55:50,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2021-11-07 07:55:50,863 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-11-07 07:55:50,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2021-11-07 07:55:50,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-11-07 07:55:50,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-11-07 07:55:50,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-11-07 07:55:50,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:55:50,865 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-11-07 07:55:50,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-11-07 07:55:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-11-07 07:55:50,868 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-11-07 07:55:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2021-11-07 07:55:50,869 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-11-07 07:55:50,869 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-11-07 07:55:50,869 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-07 07:55:50,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2021-11-07 07:55:50,870 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-11-07 07:55:50,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:55:50,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:55:50,871 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:55:50,872 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:55:50,872 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 % 4294967296 >= 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-11-07 07:55:50,872 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-11-07 07:55:50,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-11-07 07:55:50,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:50,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876828410] [2021-11-07 07:55:50,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:50,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:50,894 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:50,928 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:50,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2021-11-07 07:55:50,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:50,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593361534] [2021-11-07 07:55:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:50,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:50,950 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:50,968 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:50,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:50,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2021-11-07 07:55:50,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:50,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385532139] [2021-11-07 07:55:50,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:50,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:51,021 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:51,080 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:51,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:52,230 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 07:55:52,230 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 07:55:52,230 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 07:55:52,230 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 07:55:52,230 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-07 07:55:52,231 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:52,231 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 07:55:52,231 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 07:55:52,231 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2021-11-07 07:55:52,231 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 07:55:52,231 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 07:55:52,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:52,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:53,514 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 07:55:53,515 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-07 07:55:53,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:53,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:53,523 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:53,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-07 07:55:53,535 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-11-07 07:55:53,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:53,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:55:53,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:53,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:53,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:53,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:55:53,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:55:53,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:53,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:53,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:53,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:53,604 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:53,615 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-11-07 07:55:53,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:53,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:53,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:53,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:53,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:55:53,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:55:53,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-07 07:55:53,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:53,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:53,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:53,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:53,682 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:53,688 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-11-07 07:55:53,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:53,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:55:53,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:53,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:53,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:53,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:55:53,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:55:53,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-07 07:55:53,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:53,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:53,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:53,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:53,762 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:53,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-11-07 07:55:53,772 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-11-07 07:55:53,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:53,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:55:53,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:53,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:53,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:53,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:55:53,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:55:53,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:53,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:53,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:53,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:53,840 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:53,847 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-11-07 07:55:53,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:53,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:53,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:53,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:53,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:55:53,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:55:53,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-11-07 07:55:53,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:53,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:53,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:53,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:53,911 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:53,914 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-11-07 07:55:53,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:53,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:55:53,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:53,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:53,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:53,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:55:53,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:55:53,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-11-07 07:55:53,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:53,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:53,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:53,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:53,969 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:53,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-11-07 07:55:53,975 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-11-07 07:55:53,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:53,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:55:53,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:53,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:53,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:53,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:55:53,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:55:53,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:54,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:54,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:54,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:54,021 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:54,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-11-07 07:55:54,022 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-11-07 07:55:54,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:54,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:54,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:54,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:54,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:55:54,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:55:54,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:54,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:54,102 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:54,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:54,107 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:54,113 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-11-07 07:55:54,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:54,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:54,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:54,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:54,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-11-07 07:55:54,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:55:54,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:55:54,176 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-07 07:55:54,247 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-11-07 07:55:54,247 INFO L444 ModelExtractionUtils]: 28 out of 61 variables were initially zero. Simplification set additionally 30 variables to zero. [2021-11-07 07:55:54,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:54,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:54,248 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:54,255 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-07 07:55:54,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-11-07 07:55:54,292 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-07 07:55:54,292 INFO L513 LassoAnalysis]: Proved termination. [2021-11-07 07:55:54,292 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-11-07 07:55:54,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:54,410 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2021-11-07 07:55:54,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:54,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 07:55:54,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:55:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:54,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 07:55:54,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:55:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:55:54,520 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-11-07 07:55:54,521 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-11-07 07:55:54,546 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-11-07 07:55:54,546 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-11-07 07:55:54,547 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-11-07 07:55:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-11-07 07:55:54,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2021-11-07 07:55:54,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 07:55:54,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2021-11-07 07:55:54,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 07:55:54,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2021-11-07 07:55:54,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 07:55:54,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-11-07 07:55:54,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-11-07 07:55:54,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2021-11-07 07:55:54,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-11-07 07:55:54,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-11-07 07:55:54,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2021-11-07 07:55:54,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:55:54,565 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-11-07 07:55:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2021-11-07 07:55:54,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-11-07 07:55:54,573 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-11-07 07:55:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-11-07 07:55:54,575 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-11-07 07:55:54,575 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-11-07 07:55:54,575 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-07 07:55:54,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2021-11-07 07:55:54,578 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-11-07 07:55:54,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:55:54,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:55:54,579 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:55:54,579 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-07 07:55:54,581 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 % 4294967296 >= 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-11-07 07:55:54,581 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-11-07 07:55:54,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2021-11-07 07:55:54,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:54,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766223939] [2021-11-07 07:55:54,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:54,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 07:55:54,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:55:54,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766223939] [2021-11-07 07:55:54,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766223939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:55:54,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:55:54,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:55:54,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217108938] [2021-11-07 07:55:54,687 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:55:54,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:54,688 INFO L85 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2021-11-07 07:55:54,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:54,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832848758] [2021-11-07 07:55:54,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:54,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:54,700 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:54,709 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:54,735 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 07:55:54,735 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 07:55:54,735 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 07:55:54,736 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 07:55:54,736 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-11-07 07:55:54,736 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:54,736 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 07:55:54,736 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 07:55:54,736 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-11-07 07:55:54,737 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 07:55:54,737 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 07:55:54,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-11-07 07:55:54,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-11-07 07:55:54,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:54,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:54,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:54,837 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 07:55:54,837 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-11-07 07:55:54,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:54,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:54,843 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:54,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-11-07 07:55:54,847 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-07 07:55:54,847 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-07 07:55:54,876 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-07 07:55:54,876 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-11-07 07:55:54,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:54,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:54,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:54,923 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:54,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-07 07:55:54,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-07 07:55:54,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-11-07 07:55:54,950 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-11-07 07:55:54,951 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-11-07 07:55:54,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:54,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:54,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:54,989 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:55,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-11-07 07:55:55,003 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-07 07:55:55,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-11-07 07:55:55,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:55,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:55,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:55,069 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:55,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-11-07 07:55:55,079 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-11-07 07:55:55,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-11-07 07:55:55,287 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-11-07 07:55:55,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:55,294 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 07:55:55,294 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 07:55:55,295 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 07:55:55,295 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 07:55:55,295 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-07 07:55:55,295 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:55,295 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 07:55:55,295 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 07:55:55,295 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-11-07 07:55:55,295 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 07:55:55,295 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 07:55:55,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:55,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:55,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:55,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:55,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:55:55,370 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 07:55:55,371 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-07 07:55:55,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:55,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:55,372 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:55,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-11-07 07:55:55,379 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-11-07 07:55:55,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:55,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:55,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:55,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:55,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:55:55,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:55:55,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:55,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:55,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:55,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:55,451 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:55,457 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-11-07 07:55:55,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:55,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:55,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:55,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:55,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:55:55,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:55:55,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-11-07 07:55:55,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:55:55,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:55,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:55,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:55,524 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:55,526 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-11-07 07:55:55,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:55:55,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:55:55,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:55:55,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:55:55,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:55:55,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:55:55,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:55:55,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-11-07 07:55:55,549 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-07 07:55:55,563 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-11-07 07:55:55,564 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-11-07 07:55:55,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:55:55,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:55,566 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:55:55,567 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-07 07:55:55,568 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-11-07 07:55:55,568 INFO L513 LassoAnalysis]: Proved termination. [2021-11-07 07:55:55,568 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-11-07 07:55:55,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-11-07 07:55:55,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:55,611 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-11-07 07:55:55,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:55,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 07:55:55,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:55:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:55,696 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 07:55:55,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:55:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:55:55,744 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-11-07 07:55:55,744 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-11-07 07:55:55,826 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-11-07 07:55:55,827 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-11-07 07:55:55,827 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-11-07 07:55:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-11-07 07:55:55,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2021-11-07 07:55:55,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 07:55:55,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2021-11-07 07:55:55,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 07:55:55,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2021-11-07 07:55:55,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 07:55:55,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2021-11-07 07:55:55,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2021-11-07 07:55:55,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2021-11-07 07:55:55,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-11-07 07:55:55,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-11-07 07:55:55,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2021-11-07 07:55:55,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 07:55:55,843 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 62 transitions. [2021-11-07 07:55:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2021-11-07 07:55:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2021-11-07 07:55:55,848 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-11-07 07:55:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2021-11-07 07:55:55,850 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2021-11-07 07:55:55,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:55:55,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:55:55,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:55:55,852 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-11-07 07:55:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:55:55,904 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2021-11-07 07:55:55,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:55:55,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2021-11-07 07:55:55,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 07:55:55,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2021-11-07 07:55:55,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-11-07 07:55:55,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-11-07 07:55:55,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2021-11-07 07:55:55,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 07:55:55,912 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2021-11-07 07:55:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2021-11-07 07:55:55,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-11-07 07:55:55,924 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-11-07 07:55:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2021-11-07 07:55:55,928 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-11-07 07:55:55,928 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-11-07 07:55:55,928 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-07 07:55:55,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2021-11-07 07:55:55,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 07:55:55,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:55:55,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:55:55,930 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:55:55,931 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:55:55,931 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 % 4294967296 >= 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-11-07 07:55:55,931 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-11-07 07:55:55,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:55,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2021-11-07 07:55:55,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:55,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94738756] [2021-11-07 07:55:55,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:55,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 07:55:56,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:55:56,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94738756] [2021-11-07 07:55:56,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94738756] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:55:56,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673081219] [2021-11-07 07:55:56,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:56,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:55:56,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:56,011 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:55:56,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-07 07:55:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:56,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 07:55:56,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:55:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 07:55:56,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673081219] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:55:56,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:55:56,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2021-11-07 07:55:56,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430125597] [2021-11-07 07:55:56,169 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:55:56,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:56,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2021-11-07 07:55:56,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:56,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391819763] [2021-11-07 07:55:56,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:56,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:56,196 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:56,220 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:56,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:56,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:55:56,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 07:55:56,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-07 07:55:56,482 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-11-07 07:55:56,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-11-07 07:55:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:55:56,725 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2021-11-07 07:55:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 07:55:56,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 109 transitions. [2021-11-07 07:55:56,727 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-11-07 07:55:56,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 81 transitions. [2021-11-07 07:55:56,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-11-07 07:55:56,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-11-07 07:55:56,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 81 transitions. [2021-11-07 07:55:56,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 07:55:56,729 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 81 transitions. [2021-11-07 07:55:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 81 transitions. [2021-11-07 07:55:56,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2021-11-07 07:55:56,733 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-11-07 07:55:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2021-11-07 07:55:56,734 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2021-11-07 07:55:56,734 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2021-11-07 07:55:56,734 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-07 07:55:56,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2021-11-07 07:55:56,735 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 07:55:56,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:55:56,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:55:56,736 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:55:56,736 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:55:56,736 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 % 4294967296 >= 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-11-07 07:55:56,737 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-11-07 07:55:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2021-11-07 07:55:56,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:56,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217513326] [2021-11-07 07:55:56,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:56,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:56,770 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:56,827 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:56,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:56,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2021-11-07 07:55:56,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:56,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079478728] [2021-11-07 07:55:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:56,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:56,841 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:56,865 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2021-11-07 07:55:56,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:56,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526954601] [2021-11-07 07:55:56,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:56,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 07:55:56,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:55:56,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526954601] [2021-11-07 07:55:56,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526954601] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:55:56,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536907250] [2021-11-07 07:55:56,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:56,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:55:56,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:56,987 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:55:57,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-07 07:55:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:57,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 07:55:57,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:55:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 07:55:57,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536907250] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:55:57,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:55:57,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-11-07 07:55:57,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729781134] [2021-11-07 07:55:57,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:55:57,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 07:55:57,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-11-07 07:55:57,472 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-11-07 07:55:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:55:57,648 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2021-11-07 07:55:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 07:55:57,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 92 transitions. [2021-11-07 07:55:57,649 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2021-11-07 07:55:57,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 83 transitions. [2021-11-07 07:55:57,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-11-07 07:55:57,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-11-07 07:55:57,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 83 transitions. [2021-11-07 07:55:57,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 07:55:57,651 INFO L681 BuchiCegarLoop]: Abstraction has 62 states and 83 transitions. [2021-11-07 07:55:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 83 transitions. [2021-11-07 07:55:57,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2021-11-07 07:55:57,655 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-11-07 07:55:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2021-11-07 07:55:57,656 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-11-07 07:55:57,656 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-11-07 07:55:57,656 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-07 07:55:57,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2021-11-07 07:55:57,657 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-11-07 07:55:57,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:55:57,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:55:57,658 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:55:57,658 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-11-07 07:55:57,658 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 % 4294967296 >= 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-11-07 07:55:57,659 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-11-07 07:55:57,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:57,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1159051365, now seen corresponding path program 1 times [2021-11-07 07:55:57,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:57,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636730669] [2021-11-07 07:55:57,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:57,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:57,684 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:57,712 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:57,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:57,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2655420, now seen corresponding path program 1 times [2021-11-07 07:55:57,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:57,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852619646] [2021-11-07 07:55:57,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:57,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:57,720 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:57,726 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:57,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:57,727 INFO L85 PathProgramCache]: Analyzing trace with hash -651990240, now seen corresponding path program 1 times [2021-11-07 07:55:57,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:57,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382327981] [2021-11-07 07:55:57,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:57,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-07 07:55:57,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:55:57,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382327981] [2021-11-07 07:55:57,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382327981] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:55:57,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312799369] [2021-11-07 07:55:57,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:57,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:55:57,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:57,783 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:55:57,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-07 07:55:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:57,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 07:55:57,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:55:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-07 07:55:57,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312799369] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:55:57,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-07 07:55:57,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-11-07 07:55:57,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884077044] [2021-11-07 07:55:58,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:55:58,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 07:55:58,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-07 07:55:58,229 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-11-07 07:55:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:55:58,284 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2021-11-07 07:55:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 07:55:58,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2021-11-07 07:55:58,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 07:55:58,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2021-11-07 07:55:58,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-11-07 07:55:58,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-11-07 07:55:58,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2021-11-07 07:55:58,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 07:55:58,286 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 97 transitions. [2021-11-07 07:55:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2021-11-07 07:55:58,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2021-11-07 07:55:58,290 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-11-07 07:55:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2021-11-07 07:55:58,291 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2021-11-07 07:55:58,291 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2021-11-07 07:55:58,291 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-07 07:55:58,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 88 transitions. [2021-11-07 07:55:58,292 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 07:55:58,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:55:58,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:55:58,293 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:55:58,293 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-07 07:55:58,293 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 % 4294967296 >= 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-11-07 07:55:58,293 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-11-07 07:55:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2057131266, now seen corresponding path program 1 times [2021-11-07 07:55:58,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:58,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910703913] [2021-11-07 07:55:58,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:58,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-07 07:55:58,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:55:58,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910703913] [2021-11-07 07:55:58,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910703913] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:55:58,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:55:58,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:55:58,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277650414] [2021-11-07 07:55:58,352 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:55:58,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2021-11-07 07:55:58,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:58,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86968155] [2021-11-07 07:55:58,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:58,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:58,360 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:58,366 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:58,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:55:58,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:55:58,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:55:58,421 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-11-07 07:55:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:55:58,453 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2021-11-07 07:55:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:55:58,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2021-11-07 07:55:58,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 07:55:58,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 88 transitions. [2021-11-07 07:55:58,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-11-07 07:55:58,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-11-07 07:55:58,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 88 transitions. [2021-11-07 07:55:58,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 07:55:58,458 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 88 transitions. [2021-11-07 07:55:58,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 88 transitions. [2021-11-07 07:55:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2021-11-07 07:55:58,463 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-11-07 07:55:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2021-11-07 07:55:58,464 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2021-11-07 07:55:58,464 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2021-11-07 07:55:58,464 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-07 07:55:58,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 86 transitions. [2021-11-07 07:55:58,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-11-07 07:55:58,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:55:58,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:55:58,466 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-11-07 07:55:58,466 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:55:58,467 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 % 4294967296 >= 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-11-07 07:55:58,467 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-11-07 07:55:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:58,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1034472260, now seen corresponding path program 1 times [2021-11-07 07:55:58,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:58,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189548610] [2021-11-07 07:55:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:58,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-07 07:55:58,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:55:58,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189548610] [2021-11-07 07:55:58,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189548610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:55:58,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:55:58,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 07:55:58,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453261986] [2021-11-07 07:55:58,500 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:55:58,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:58,501 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 3 times [2021-11-07 07:55:58,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:58,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93009170] [2021-11-07 07:55:58,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:58,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:58,508 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:58,515 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:58,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:55:58,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 07:55:58,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 07:55:58,750 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-11-07 07:55:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:55:58,763 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2021-11-07 07:55:58,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 07:55:58,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2021-11-07 07:55:58,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-11-07 07:55:58,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2021-11-07 07:55:58,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-11-07 07:55:58,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-11-07 07:55:58,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2021-11-07 07:55:58,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 07:55:58,766 INFO L681 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-11-07 07:55:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2021-11-07 07:55:58,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-11-07 07:55:58,770 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-11-07 07:55:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2021-11-07 07:55:58,777 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-11-07 07:55:58,777 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-11-07 07:55:58,777 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-07 07:55:58,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2021-11-07 07:55:58,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-11-07 07:55:58,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:55:58,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:55:58,779 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-11-07 07:55:58,779 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:55:58,779 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 % 4294967296 >= 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-11-07 07:55:58,779 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-11-07 07:55:58,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:58,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2021-11-07 07:55:58,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:58,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187543729] [2021-11-07 07:55:58,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:58,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 07:55:58,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:55:58,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187543729] [2021-11-07 07:55:58,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187543729] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:55:58,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823210128] [2021-11-07 07:55:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:58,944 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:55:58,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:55:58,946 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:55:58,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-07 07:55:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:55:59,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 07:55:59,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:55:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 07:55:59,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823210128] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:55:59,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:55:59,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-11-07 07:55:59,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047951571] [2021-11-07 07:55:59,272 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:55:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:59,272 INFO L85 PathProgramCache]: Analyzing trace with hash 782608452, now seen corresponding path program 1 times [2021-11-07 07:55:59,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:59,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676658053] [2021-11-07 07:55:59,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:59,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:59,279 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:59,286 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:59,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:55:59,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 07:55:59,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-11-07 07:55:59,404 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-11-07 07:55:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:55:59,742 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2021-11-07 07:55:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 07:55:59,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 99 transitions. [2021-11-07 07:55:59,744 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-11-07 07:55:59,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 99 transitions. [2021-11-07 07:55:59,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-11-07 07:55:59,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-11-07 07:55:59,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 99 transitions. [2021-11-07 07:55:59,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-07 07:55:59,746 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 99 transitions. [2021-11-07 07:55:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 99 transitions. [2021-11-07 07:55:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2021-11-07 07:55:59,750 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-11-07 07:55:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2021-11-07 07:55:59,750 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-11-07 07:55:59,750 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-11-07 07:55:59,750 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-07 07:55:59,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2021-11-07 07:55:59,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-11-07 07:55:59,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:55:59,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:55:59,752 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-11-07 07:55:59,752 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-07 07:55:59,752 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 % 4294967296 >= 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-11-07 07:55:59,752 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-11-07 07:55:59,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:59,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2021-11-07 07:55:59,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:59,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792214205] [2021-11-07 07:55:59,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:59,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:59,782 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:59,808 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:59,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:59,809 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 2 times [2021-11-07 07:55:59,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:59,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634367156] [2021-11-07 07:55:59,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:59,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:59,814 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:59,817 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:55:59,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:55:59,818 INFO L85 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2021-11-07 07:55:59,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:55:59,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98208695] [2021-11-07 07:55:59,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:55:59,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:55:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:59,848 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:55:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:55:59,881 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:56:05,886 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 07:56:05,886 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 07:56:05,886 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 07:56:05,886 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 07:56:05,886 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-07 07:56:05,886 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:56:05,886 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 07:56:05,886 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 07:56:05,886 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration11_Lasso [2021-11-07 07:56:05,887 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 07:56:05,887 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 07:56:05,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:56:05,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-11-07 07:56:05,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-11-07 07:56:05,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:56:05,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:56:05,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-11-07 07:56:05,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:56:05,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:56:05,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:56:05,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:56:05,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:56:05,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:56:05,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:56:05,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:56:05,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-07 07:56:06,605 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-11-07 07:56:06,609 INFO L168 Benchmark]: Toolchain (without parser) took 19523.11 ms. Allocated memory was 100.7 MB in the beginning and 186.6 MB in the end (delta: 86.0 MB). Free memory was 65.1 MB in the beginning and 80.0 MB in the end (delta: -14.8 MB). Peak memory consumption was 108.6 MB. Max. memory is 16.1 GB. [2021-11-07 07:56:06,609 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 100.7 MB. Free memory is still 55.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 07:56:06,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.14 ms. Allocated memory was 100.7 MB in the beginning and 136.3 MB in the end (delta: 35.7 MB). Free memory was 65.1 MB in the beginning and 103.0 MB in the end (delta: -37.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 07:56:06,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.23 ms. Allocated memory is still 136.3 MB. Free memory was 103.0 MB in the beginning and 100.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 07:56:06,610 INFO L168 Benchmark]: Boogie Preprocessor took 53.17 ms. Allocated memory is still 136.3 MB. Free memory was 100.9 MB in the beginning and 99.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 07:56:06,611 INFO L168 Benchmark]: RCFGBuilder took 449.11 ms. Allocated memory is still 136.3 MB. Free memory was 99.5 MB in the beginning and 87.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 07:56:06,611 INFO L168 Benchmark]: BuchiAutomizer took 18267.81 ms. Allocated memory was 136.3 MB in the beginning and 186.6 MB in the end (delta: 50.3 MB). Free memory was 86.9 MB in the beginning and 80.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 96.7 MB. Max. memory is 16.1 GB. [2021-11-07 07:56:06,613 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.26 ms. Allocated memory is still 100.7 MB. Free memory is still 55.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 661.14 ms. Allocated memory was 100.7 MB in the beginning and 136.3 MB in the end (delta: 35.7 MB). Free memory was 65.1 MB in the beginning and 103.0 MB in the end (delta: -37.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 83.23 ms. Allocated memory is still 136.3 MB. Free memory was 103.0 MB in the beginning and 100.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.17 ms. Allocated memory is still 136.3 MB. Free memory was 100.9 MB in the beginning and 99.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 449.11 ms. Allocated memory is still 136.3 MB. Free memory was 99.5 MB in the beginning and 87.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 18267.81 ms. Allocated memory was 136.3 MB in the beginning and 186.6 MB in the end (delta: 50.3 MB). Free memory was 86.9 MB in the beginning and 80.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 96.7 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-11-07 07:56:06,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-07 07:56:06,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-07 07:56:07,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2021-11-07 07:56:07,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-11-07 07:56:07,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32c4f383-fba2-4756-aa17-35e1754a0db7/bin/uautomizer-AkOaLMaTGY/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)