./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:48:09,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:48:09,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:48:09,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:48:09,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:48:09,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:48:09,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:48:09,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:48:09,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:48:09,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:48:09,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:48:09,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:48:09,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:48:09,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:48:09,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:48:09,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:48:09,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:48:09,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:48:09,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:48:09,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:48:09,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:48:09,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:48:09,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:48:09,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:48:09,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:48:09,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:48:09,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:48:09,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:48:09,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:48:09,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:48:09,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:48:09,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:48:09,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:48:09,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:48:09,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:48:09,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:48:09,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:48:09,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:48:09,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:48:09,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:48:09,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:48:09,859 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-20 10:48:09,897 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:48:09,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:48:09,898 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:48:09,898 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:48:09,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:48:09,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:48:09,901 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:48:09,901 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-20 10:48:09,902 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-20 10:48:09,902 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-20 10:48:09,911 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-20 10:48:09,911 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-20 10:48:09,912 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-20 10:48:09,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:48:09,912 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:48:09,912 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:48:09,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:48:09,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:48:09,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:48:09,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-20 10:48:09,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-20 10:48:09,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-20 10:48:09,914 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:48:09,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:48:09,915 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-20 10:48:09,915 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:48:09,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-20 10:48:09,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:48:09,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:48:09,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:48:09,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:48:09,918 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-20 10:48:09,918 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_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/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_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN 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 [2022-11-20 10:48:10,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:48:10,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:48:10,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:48:10,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:48:10,234 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:48:10,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-11-20 10:48:13,328 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:48:13,594 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:48:13,594 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-11-20 10:48:13,607 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/data/da09c5437/563c40c3054443f297cf45f570122bda/FLAGef5b20e77 [2022-11-20 10:48:13,629 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/data/da09c5437/563c40c3054443f297cf45f570122bda [2022-11-20 10:48:13,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:48:13,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:48:13,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:48:13,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:48:13,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:48:13,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:48:13" (1/1) ... [2022-11-20 10:48:13,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16650624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:13, skipping insertion in model container [2022-11-20 10:48:13,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:48:13" (1/1) ... [2022-11-20 10:48:13,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:48:13,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:48:13,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:48:13,997 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:48:14,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:48:14,069 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:48:14,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:14 WrapperNode [2022-11-20 10:48:14,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:48:14,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:48:14,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:48:14,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:48:14,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:14" (1/1) ... [2022-11-20 10:48:14,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:14" (1/1) ... [2022-11-20 10:48:14,134 INFO L138 Inliner]: procedures = 116, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2022-11-20 10:48:14,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:48:14,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:48:14,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:48:14,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:48:14,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:14" (1/1) ... [2022-11-20 10:48:14,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:14" (1/1) ... [2022-11-20 10:48:14,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:14" (1/1) ... [2022-11-20 10:48:14,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:14" (1/1) ... [2022-11-20 10:48:14,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:14" (1/1) ... [2022-11-20 10:48:14,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:14" (1/1) ... [2022-11-20 10:48:14,163 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:14" (1/1) ... [2022-11-20 10:48:14,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:14" (1/1) ... [2022-11-20 10:48:14,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:48:14,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:48:14,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:48:14,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:48:14,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:14" (1/1) ... [2022-11-20 10:48:14,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:14,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:14,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:14,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-20 10:48:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:48:14,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:48:14,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:48:14,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:48:14,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:48:14,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:48:14,399 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:48:14,402 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:48:14,771 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:48:14,777 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:48:14,778 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-20 10:48:14,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:48:14 BoogieIcfgContainer [2022-11-20 10:48:14,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:48:14,782 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-20 10:48:14,782 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-20 10:48:14,791 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-20 10:48:14,792 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:48:14,792 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:48:13" (1/3) ... [2022-11-20 10:48:14,793 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e14e759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:48:14, skipping insertion in model container [2022-11-20 10:48:14,793 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:48:14,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:14" (2/3) ... [2022-11-20 10:48:14,794 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e14e759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:48:14, skipping insertion in model container [2022-11-20 10:48:14,794 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 10:48:14,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:48:14" (3/3) ... [2022-11-20 10:48:14,796 INFO L332 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2022-11-20 10:48:14,871 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-20 10:48:14,872 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-20 10:48:14,872 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-20 10:48:14,872 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-20 10:48:14,872 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-20 10:48:14,872 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-20 10:48:14,872 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-20 10:48:14,873 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-20 10:48:14,880 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) [2022-11-20 10:48:14,905 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2022-11-20 10:48:14,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:14,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:14,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-20 10:48:14,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:48:14,914 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-20 10:48:14,915 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) [2022-11-20 10:48:14,920 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2022-11-20 10:48:14,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:14,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:14,921 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-20 10:48:14,921 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:48:14,931 INFO L748 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 10#L530true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6#L530-2true call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3#L535-3true [2022-11-20 10:48:14,931 INFO L750 eck$LassoCheckResult]: Loop: 3#L535-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 16#L535-2true main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3#L535-3true [2022-11-20 10:48:14,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-11-20 10:48:14,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:14,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136208565] [2022-11-20 10:48:14,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:15,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:15,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:15,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:15,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-11-20 10:48:15,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:15,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312755288] [2022-11-20 10:48:15,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:15,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:15,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:15,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:15,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-11-20 10:48:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:15,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114689740] [2022-11-20 10:48:15,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:15,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:15,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:15,717 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 10:48:15,718 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 10:48:15,718 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 10:48:15,718 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 10:48:15,718 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 10:48:15,718 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:15,719 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 10:48:15,719 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 10:48:15,719 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2022-11-20 10:48:15,719 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 10:48:15,719 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 10:48:15,739 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:15,749 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:15,754 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:15,757 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:15,760 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:15,763 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:15,957 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:15,962 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:15,966 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:15,969 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:16,348 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 10:48:16,353 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 10:48:16,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:16,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:16,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:16,369 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 [2022-11-20 10:48:16,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:16,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:16,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:16,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:16,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:16,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-20 10:48:16,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:16,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:16,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:16,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:16,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:16,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:16,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:16,427 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 [2022-11-20 10:48:16,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-20 10:48:16,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:16,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:16,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:16,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:16,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:16,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:16,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:16,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:16,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:16,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:16,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:16,489 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 [2022-11-20 10:48:16,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-20 10:48:16,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:16,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:16,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:16,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:16,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:16,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:16,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:16,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:16,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:16,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:16,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:16,553 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 [2022-11-20 10:48:16,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:16,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:16,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:16,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:16,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-20 10:48:16,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:16,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:16,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:16,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:16,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:16,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:16,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:16,598 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 [2022-11-20 10:48:16,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:16,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:16,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:16,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:16,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:16,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:16,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:16,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-20 10:48:16,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:16,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:16,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:16,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:16,630 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:16,639 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 [2022-11-20 10:48:16,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-20 10:48:16,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:16,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:16,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:16,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:16,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:16,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:16,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:16,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:16,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:16,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:16,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:16,681 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:16,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 10:48:16,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-20 10:48:16,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:16,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:16,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:16,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:16,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:16,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:16,741 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 10:48:16,793 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-11-20 10:48:16,794 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-11-20 10:48:16,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:16,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:16,831 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:16,885 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 10:48:16,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-20 10:48:16,904 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-20 10:48:16,904 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 10:48:16,905 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~array_size~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~array_size~0#1 Supporting invariants [] [2022-11-20 10:48:16,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:16,926 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-11-20 10:48:16,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:16,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:48:16,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:17,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:48:17,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:48:17,080 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-20 10:48:17,083 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) [2022-11-20 10:48:17,169 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. [2022-11-20 10:48:17,171 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 [2022-11-20 10:48:17,181 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) [2022-11-20 10:48:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-11-20 10:48:17,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2022-11-20 10:48:17,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:48:17,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2022-11-20 10:48:17,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:48:17,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 4 letters. [2022-11-20 10:48:17,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:48:17,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 99 transitions. [2022-11-20 10:48:17,199 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-20 10:48:17,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 21 states and 30 transitions. [2022-11-20 10:48:17,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-11-20 10:48:17,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-20 10:48:17,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2022-11-20 10:48:17,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:48:17,207 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2022-11-20 10:48:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2022-11-20 10:48:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-20 10:48:17,236 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) [2022-11-20 10:48:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2022-11-20 10:48:17,240 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2022-11-20 10:48:17,240 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2022-11-20 10:48:17,240 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-20 10:48:17,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2022-11-20 10:48:17,243 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-20 10:48:17,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:17,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:17,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-20 10:48:17,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:48:17,249 INFO L748 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 159#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 155#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 146#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 148#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 161#L517-3 [2022-11-20 10:48:17,249 INFO L750 eck$LassoCheckResult]: Loop: 161#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 160#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 161#L517-3 [2022-11-20 10:48:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:17,251 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-11-20 10:48:17,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:17,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289989055] [2022-11-20 10:48:17,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:48:17,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:17,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289989055] [2022-11-20 10:48:17,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289989055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:17,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:17,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:48:17,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813837765] [2022-11-20 10:48:17,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:17,459 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:48:17,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:17,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2022-11-20 10:48:17,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:17,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281136318] [2022-11-20 10:48:17,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:17,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:17,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:17,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:17,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:17,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:48:17,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:48:17,576 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) [2022-11-20 10:48:17,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:17,684 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-11-20 10:48:17,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2022-11-20 10:48:17,684 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-20 10:48:17,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2022-11-20 10:48:17,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-11-20 10:48:17,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-11-20 10:48:17,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-11-20 10:48:17,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:48:17,686 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-11-20 10:48:17,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-11-20 10:48:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-11-20 10:48:17,688 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) [2022-11-20 10:48:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-11-20 10:48:17,688 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-11-20 10:48:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:48:17,697 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-11-20 10:48:17,697 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-20 10:48:17,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2022-11-20 10:48:17,698 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2022-11-20 10:48:17,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:17,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:17,699 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:17,699 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-20 10:48:17,699 INFO L748 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 209#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 205#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 196#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 197#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 198#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 199#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 211#L517-3 [2022-11-20 10:48:17,699 INFO L750 eck$LassoCheckResult]: Loop: 211#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 210#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 211#L517-3 [2022-11-20 10:48:17,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:17,700 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-11-20 10:48:17,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:17,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701254506] [2022-11-20 10:48:17,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:17,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:17,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:17,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:17,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:17,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2022-11-20 10:48:17,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:17,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140043088] [2022-11-20 10:48:17,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:17,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:17,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:17,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:17,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:17,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2022-11-20 10:48:17,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:17,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069502247] [2022-11-20 10:48:17,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:17,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:17,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:17,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:18,820 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 10:48:18,821 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 10:48:18,821 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 10:48:18,821 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 10:48:18,821 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 10:48:18,821 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:18,821 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 10:48:18,821 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 10:48:18,821 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2022-11-20 10:48:18,822 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 10:48:18,822 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 10:48:18,827 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,830 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,833 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,836 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,838 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,841 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,844 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,848 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,852 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,855 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,858 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,862 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,865 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,868 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,871 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,873 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,877 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,879 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,882 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,886 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,888 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,891 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,893 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,896 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:18,899 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:19,645 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:20,591 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 10:48:20,591 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 10:48:20,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:20,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:20,598 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:20,613 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 [2022-11-20 10:48:20,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-20 10:48:20,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:20,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:20,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:20,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:20,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:20,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:20,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:20,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:20,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:20,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:20,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:20,643 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:20,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-20 10:48:20,648 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 [2022-11-20 10:48:20,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:20,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:20,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:20,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:20,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:20,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:20,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:20,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:20,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:20,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:20,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:20,688 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:20,696 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 [2022-11-20 10:48:20,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-20 10:48:20,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:20,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:20,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:20,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:20,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:20,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:20,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:20,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:20,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:20,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:20,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:20,729 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:20,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-20 10:48:20,733 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 [2022-11-20 10:48:20,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:20,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:20,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:20,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:20,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:20,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:20,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:20,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:20,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:20,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:20,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:20,760 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:20,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-20 10:48:20,767 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 [2022-11-20 10:48:20,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:20,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:20,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:20,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:20,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:20,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:20,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:20,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:20,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:20,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:20,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:20,789 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:20,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-20 10:48:20,792 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 [2022-11-20 10:48:20,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:20,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:20,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:20,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:20,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:20,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:20,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:20,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:20,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:20,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:20,841 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:20,849 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 [2022-11-20 10:48:20,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-20 10:48:20,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:20,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:20,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:20,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:20,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:20,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:20,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:20,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:20,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:20,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:20,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:20,880 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:20,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-20 10:48:20,888 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 [2022-11-20 10:48:20,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:20,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:20,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:20,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:20,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:20,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:20,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:20,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:20,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:20,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:20,954 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:20,963 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 [2022-11-20 10:48:20,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-20 10:48:20,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:20,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:20,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:20,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:20,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:20,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:20,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:20,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:20,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:20,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:20,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:20,997 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,008 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 [2022-11-20 10:48:21,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-20 10:48:21,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:21,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:21,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:21,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,044 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,060 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 [2022-11-20 10:48:21,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-20 10:48:21,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:21,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:21,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:21,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,101 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,110 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 [2022-11-20 10:48:21,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-20 10:48:21,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:21,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:21,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:21,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,150 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,156 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 [2022-11-20 10:48:21,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-20 10:48:21,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:21,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:21,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,204 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-20 10:48:21,208 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 [2022-11-20 10:48:21,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:21,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:21,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:21,222 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,226 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-20 10:48:21,229 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 [2022-11-20 10:48:21,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:21,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:21,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:21,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,250 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-20 10:48:21,255 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 [2022-11-20 10:48:21,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:21,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:21,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,289 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-20 10:48:21,294 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 [2022-11-20 10:48:21,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:21,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:21,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:21,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,312 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-20 10:48:21,315 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 [2022-11-20 10:48:21,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:21,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:21,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:21,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,341 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-20 10:48:21,350 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 [2022-11-20 10:48:21,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:21,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:21,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,402 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,410 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 [2022-11-20 10:48:21,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-20 10:48:21,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:21,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:21,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:21,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,449 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,453 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 [2022-11-20 10:48:21,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-20 10:48:21,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:21,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:21,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:21,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,500 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,508 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 [2022-11-20 10:48:21,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-20 10:48:21,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:21,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:21,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:21,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,542 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,546 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 [2022-11-20 10:48:21,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-20 10:48:21,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:21,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:21,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:21,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,570 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-20 10:48:21,573 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 [2022-11-20 10:48:21,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:21,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:21,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,607 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-20 10:48:21,611 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 [2022-11-20 10:48:21,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:21,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:21,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,659 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-20 10:48:21,662 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 [2022-11-20 10:48:21,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:21,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:21,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:21,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,679 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-20 10:48:21,683 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 [2022-11-20 10:48:21,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:21,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:21,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:21,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,701 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-11-20 10:48:21,705 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 [2022-11-20 10:48:21,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,720 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:21,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:21,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,731 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-20 10:48:21,734 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 [2022-11-20 10:48:21,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:21,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:21,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,769 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-20 10:48:21,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 [2022-11-20 10:48:21,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:21,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:21,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,841 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,849 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 [2022-11-20 10:48:21,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-20 10:48:21,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:21,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:21,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:21,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:21,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:21,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:21,896 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:21,903 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 [2022-11-20 10:48:21,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-11-20 10:48:21,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:21,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:21,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:21,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:21,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:21,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:21,975 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 10:48:22,052 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-11-20 10:48:22,052 INFO L444 ModelExtractionUtils]: 9 out of 61 variables were initially zero. Simplification set additionally 48 variables to zero. [2022-11-20 10:48:22,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:22,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:22,055 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:22,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 10:48:22,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-11-20 10:48:22,093 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-20 10:48:22,093 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 10:48:22,093 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~best~0#1.offset, v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_1, ULTIMATE.start_lis_~i~0#1) = -1*ULTIMATE.start_lis_~best~0#1.offset + 1*v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_1 - 4*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2022-11-20 10:48:22,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:22,196 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2022-11-20 10:48:22,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:22,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:48:22,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:22,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:48:22,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:48:22,309 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-20 10:48:22,309 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) [2022-11-20 10:48:22,348 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. [2022-11-20 10:48:22,348 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 [2022-11-20 10:48:22,349 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) [2022-11-20 10:48:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-11-20 10:48:22,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2022-11-20 10:48:22,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:48:22,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2022-11-20 10:48:22,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:48:22,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2022-11-20 10:48:22,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:48:22,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2022-11-20 10:48:22,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-20 10:48:22,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2022-11-20 10:48:22,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-11-20 10:48:22,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-11-20 10:48:22,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2022-11-20 10:48:22,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:48:22,353 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-11-20 10:48:22,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2022-11-20 10:48:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-20 10:48:22,355 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) [2022-11-20 10:48:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2022-11-20 10:48:22,356 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-11-20 10:48:22,356 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2022-11-20 10:48:22,356 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-20 10:48:22,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2022-11-20 10:48:22,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-11-20 10:48:22,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:22,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:22,358 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:22,358 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-20 10:48:22,358 INFO L748 eck$LassoCheckResult]: Stem: 387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 388#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 396#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 392#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 383#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 384#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 385#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 386#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 403#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 404#L517-4 lis_~i~0#1 := 1; 395#L519-3 [2022-11-20 10:48:22,359 INFO L750 eck$LassoCheckResult]: Loop: 395#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 389#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 390#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 395#L519-3 [2022-11-20 10:48:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:22,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2022-11-20 10:48:22,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:22,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100567747] [2022-11-20 10:48:22,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:22,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:48:22,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:22,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100567747] [2022-11-20 10:48:22,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100567747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:22,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:22,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:48:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711137370] [2022-11-20 10:48:22,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:22,469 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:48:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:22,469 INFO L85 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2022-11-20 10:48:22,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:22,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052350872] [2022-11-20 10:48:22,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:22,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:22,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:22,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:22,500 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 10:48:22,500 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 10:48:22,500 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 10:48:22,501 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 10:48:22,501 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 10:48:22,501 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:22,501 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 10:48:22,501 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 10:48:22,501 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2022-11-20 10:48:22,501 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 10:48:22,502 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 10:48:22,503 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:22,512 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:22,516 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:22,518 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:22,521 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:22,575 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 10:48:22,576 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 10:48:22,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:22,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:22,579 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:22,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-11-20 10:48:22,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 10:48:22,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 10:48:22,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:22,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:22,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:22,607 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:22,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-11-20 10:48:22,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 10:48:22,611 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 10:48:22,734 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 10:48:22,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:22,738 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 10:48:22,738 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 10:48:22,738 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 10:48:22,738 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 10:48:22,738 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 10:48:22,738 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:22,738 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 10:48:22,738 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 10:48:22,738 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2022-11-20 10:48:22,738 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 10:48:22,738 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 10:48:22,739 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:22,758 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:22,761 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:22,764 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:22,768 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:22,836 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 10:48:22,836 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 10:48:22,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:22,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:22,838 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:22,843 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 [2022-11-20 10:48:22,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-11-20 10:48:22,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:22,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:22,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:22,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:22,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:22,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:22,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:22,875 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 10:48:22,880 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-20 10:48:22,880 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-20 10:48:22,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:22,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:22,887 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:22,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-11-20 10:48:22,890 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 10:48:22,890 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 10:48:22,890 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 10:48:22,890 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [] [2022-11-20 10:48:22,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:22,894 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 10:48:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:22,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:48:22,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:22,963 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:48:22,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:48:22,999 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-11-20 10:48:23,000 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) [2022-11-20 10:48:23,078 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. [2022-11-20 10:48:23,079 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 [2022-11-20 10:48:23,079 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) [2022-11-20 10:48:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-11-20 10:48:23,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2022-11-20 10:48:23,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:48:23,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2022-11-20 10:48:23,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:48:23,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2022-11-20 10:48:23,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:48:23,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2022-11-20 10:48:23,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-11-20 10:48:23,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2022-11-20 10:48:23,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-11-20 10:48:23,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-11-20 10:48:23,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2022-11-20 10:48:23,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:48:23,097 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2022-11-20 10:48:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2022-11-20 10:48:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2022-11-20 10:48:23,104 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) [2022-11-20 10:48:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2022-11-20 10:48:23,105 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 50 transitions. [2022-11-20 10:48:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:23,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:48:23,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:48:23,107 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) [2022-11-20 10:48:23,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:23,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:23,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:23,187 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2022-11-20 10:48:23,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2022-11-20 10:48:23,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-20 10:48:23,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2022-11-20 10:48:23,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-11-20 10:48:23,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-11-20 10:48:23,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2022-11-20 10:48:23,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:48:23,194 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2022-11-20 10:48:23,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2022-11-20 10:48:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-11-20 10:48:23,203 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) [2022-11-20 10:48:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2022-11-20 10:48:23,207 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 49 transitions. [2022-11-20 10:48:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:48:23,210 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2022-11-20 10:48:23,210 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-20 10:48:23,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2022-11-20 10:48:23,211 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-20 10:48:23,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:23,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:23,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:23,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:23,212 INFO L748 eck$LassoCheckResult]: Stem: 588#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 604#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 595#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 584#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 585#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 586#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 587#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 613#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 605#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 606#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 614#L517-4 lis_~i~0#1 := 1; 615#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 590#L520-3 [2022-11-20 10:48:23,213 INFO L750 eck$LassoCheckResult]: Loop: 590#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 591#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 596#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 597#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 607#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 600#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 601#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 590#L520-3 [2022-11-20 10:48:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:23,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2022-11-20 10:48:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:23,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136651192] [2022-11-20 10:48:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:48:23,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:23,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136651192] [2022-11-20 10:48:23,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136651192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:48:23,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899655735] [2022-11-20 10:48:23,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:23,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:48:23,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:23,395 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:48:23,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-20 10:48:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:23,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:48:23,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:48:23,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:48:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:48:23,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899655735] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:48:23,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:48:23,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2022-11-20 10:48:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050891895] [2022-11-20 10:48:23,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:48:23,606 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:48:23,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2022-11-20 10:48:23,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:23,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002821219] [2022-11-20 10:48:23,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:23,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:23,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:23,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:23,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:23,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:48:23,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:48:23,872 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 21 Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:48:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:24,139 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2022-11-20 10:48:24,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 109 transitions. [2022-11-20 10:48:24,140 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-11-20 10:48:24,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 81 transitions. [2022-11-20 10:48:24,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-11-20 10:48:24,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-11-20 10:48:24,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 81 transitions. [2022-11-20 10:48:24,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:48:24,142 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 81 transitions. [2022-11-20 10:48:24,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 81 transitions. [2022-11-20 10:48:24,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2022-11-20 10:48:24,144 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) [2022-11-20 10:48:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-11-20 10:48:24,144 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 51 transitions. [2022-11-20 10:48:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:48:24,150 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2022-11-20 10:48:24,150 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-20 10:48:24,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2022-11-20 10:48:24,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-20 10:48:24,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:24,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:24,152 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:24,152 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:24,152 INFO L748 eck$LassoCheckResult]: Stem: 800#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 801#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 816#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 807#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 796#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 797#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 798#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 799#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 831#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 826#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 827#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 817#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 818#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 830#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 832#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 828#L517-4 lis_~i~0#1 := 1; 820#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 802#L520-3 [2022-11-20 10:48:24,152 INFO L750 eck$LassoCheckResult]: Loop: 802#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 803#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 808#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 809#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 819#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 812#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 813#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 802#L520-3 [2022-11-20 10:48:24,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:24,153 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2022-11-20 10:48:24,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:24,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820143250] [2022-11-20 10:48:24,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:24,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:24,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:24,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:24,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2022-11-20 10:48:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:24,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301417252] [2022-11-20 10:48:24,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:24,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:24,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:24,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2022-11-20 10:48:24,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:24,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762294718] [2022-11-20 10:48:24,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:24,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:48:24,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:24,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762294718] [2022-11-20 10:48:24,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762294718] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:48:24,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968340707] [2022-11-20 10:48:24,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:24,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:48:24,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:24,403 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:48:24,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-11-20 10:48:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:24,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 10:48:24,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:48:24,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:48:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:48:24,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968340707] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:48:24,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:48:24,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-11-20 10:48:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660003556] [2022-11-20 10:48:24,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:48:24,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:24,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:48:24,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:48:24,916 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 19 Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:48:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:25,080 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-11-20 10:48:25,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 92 transitions. [2022-11-20 10:48:25,080 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2022-11-20 10:48:25,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 83 transitions. [2022-11-20 10:48:25,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-11-20 10:48:25,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-11-20 10:48:25,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 83 transitions. [2022-11-20 10:48:25,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:48:25,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-11-20 10:48:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 83 transitions. [2022-11-20 10:48:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-11-20 10:48:25,085 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) [2022-11-20 10:48:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2022-11-20 10:48:25,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 75 transitions. [2022-11-20 10:48:25,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:48:25,086 INFO L428 stractBuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2022-11-20 10:48:25,086 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-20 10:48:25,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2022-11-20 10:48:25,087 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-11-20 10:48:25,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:25,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:25,088 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:25,088 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-20 10:48:25,088 INFO L748 eck$LassoCheckResult]: Stem: 1071#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1072#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1086#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1078#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1067#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1068#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1069#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1070#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1115#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1097#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1098#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1087#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1088#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1101#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1105#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1099#L517-4 lis_~i~0#1 := 1; 1100#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1109#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1093#L521 [2022-11-20 10:48:25,088 INFO L750 eck$LassoCheckResult]: Loop: 1093#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1079#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1080#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1092#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1093#L521 [2022-11-20 10:48:25,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1159051365, now seen corresponding path program 1 times [2022-11-20 10:48:25,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:25,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490493468] [2022-11-20 10:48:25,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:25,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:25,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:25,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:25,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2655420, now seen corresponding path program 1 times [2022-11-20 10:48:25,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:25,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490631752] [2022-11-20 10:48:25,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:25,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:25,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:25,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:25,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:25,148 INFO L85 PathProgramCache]: Analyzing trace with hash -651990240, now seen corresponding path program 1 times [2022-11-20 10:48:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:25,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229143733] [2022-11-20 10:48:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 10:48:25,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:25,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229143733] [2022-11-20 10:48:25,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229143733] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:48:25,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822346783] [2022-11-20 10:48:25,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:25,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:48:25,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:25,238 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:48:25,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-20 10:48:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:25,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:48:25,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 10:48:25,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:48:25,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822346783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:25,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:48:25,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-11-20 10:48:25,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689073227] [2022-11-20 10:48:25,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:25,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:25,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:48:25,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:48:25,656 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) [2022-11-20 10:48:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:25,727 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-11-20 10:48:25,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2022-11-20 10:48:25,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-20 10:48:25,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2022-11-20 10:48:25,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-11-20 10:48:25,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-11-20 10:48:25,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2022-11-20 10:48:25,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:48:25,730 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-11-20 10:48:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2022-11-20 10:48:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2022-11-20 10:48:25,733 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) [2022-11-20 10:48:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2022-11-20 10:48:25,733 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 88 transitions. [2022-11-20 10:48:25,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:48:25,735 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2022-11-20 10:48:25,735 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-20 10:48:25,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 88 transitions. [2022-11-20 10:48:25,736 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-20 10:48:25,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:25,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:25,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:25,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-20 10:48:25,737 INFO L748 eck$LassoCheckResult]: Stem: 1274#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1289#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1281#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1270#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1271#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1272#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1273#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1319#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1306#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1307#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1310#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1311#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1290#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1291#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1308#L517-4 lis_~i~0#1 := 1; 1292#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1293#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1332#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1314#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 1309#L519-4 lis_~i~0#1 := 0; 1303#L523-3 [2022-11-20 10:48:25,737 INFO L750 eck$LassoCheckResult]: Loop: 1303#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 1304#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 1305#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 1303#L523-3 [2022-11-20 10:48:25,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:25,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2057131266, now seen corresponding path program 1 times [2022-11-20 10:48:25,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:25,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658549902] [2022-11-20 10:48:25,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:25,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 10:48:25,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:25,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658549902] [2022-11-20 10:48:25,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658549902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:25,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:25,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:48:25,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129756829] [2022-11-20 10:48:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:25,803 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:48:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:25,803 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2022-11-20 10:48:25,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:25,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577978226] [2022-11-20 10:48:25,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:25,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:25,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:25,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:25,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:25,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:48:25,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:48:25,892 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) [2022-11-20 10:48:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:25,939 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2022-11-20 10:48:25,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2022-11-20 10:48:25,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-20 10:48:25,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 88 transitions. [2022-11-20 10:48:25,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-11-20 10:48:25,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-11-20 10:48:25,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 88 transitions. [2022-11-20 10:48:25,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:48:25,942 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-11-20 10:48:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 88 transitions. [2022-11-20 10:48:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-11-20 10:48:25,945 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) [2022-11-20 10:48:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2022-11-20 10:48:25,946 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-11-20 10:48:25,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:48:25,947 INFO L428 stractBuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-11-20 10:48:25,947 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-20 10:48:25,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 86 transitions. [2022-11-20 10:48:25,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-11-20 10:48:25,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:25,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:25,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:25,949 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:25,949 INFO L748 eck$LassoCheckResult]: Stem: 1412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1413#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1425#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1418#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1408#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1409#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1410#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1411#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1462#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1458#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1457#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1459#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1443#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1426#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1427#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1456#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1455#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1454#L517-4 lis_~i~0#1 := 1; 1452#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1453#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1433#L521 assume !lis_#t~short11#1; 1419#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1420#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1414#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1415#L519-2 [2022-11-20 10:48:25,949 INFO L750 eck$LassoCheckResult]: Loop: 1415#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1423#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1447#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1464#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1466#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1465#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1463#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1415#L519-2 [2022-11-20 10:48:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:25,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1034472260, now seen corresponding path program 1 times [2022-11-20 10:48:25,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:25,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411581931] [2022-11-20 10:48:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:25,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-20 10:48:25,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:25,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411581931] [2022-11-20 10:48:25,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411581931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:25,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:25,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:48:25,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767782492] [2022-11-20 10:48:25,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:25,991 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:48:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 3 times [2022-11-20 10:48:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:25,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822017089] [2022-11-20 10:48:25,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:25,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:26,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:26,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:26,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:48:26,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:48:26,222 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) [2022-11-20 10:48:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:26,240 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2022-11-20 10:48:26,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2022-11-20 10:48:26,240 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-20 10:48:26,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2022-11-20 10:48:26,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-11-20 10:48:26,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-11-20 10:48:26,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2022-11-20 10:48:26,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:48:26,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-20 10:48:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2022-11-20 10:48:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-20 10:48:26,245 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) [2022-11-20 10:48:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2022-11-20 10:48:26,245 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-20 10:48:26,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:48:26,246 INFO L428 stractBuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-11-20 10:48:26,246 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-20 10:48:26,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2022-11-20 10:48:26,247 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-20 10:48:26,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:26,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:26,248 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:26,248 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:26,249 INFO L748 eck$LassoCheckResult]: Stem: 1551#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1552#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1566#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1557#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1547#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1548#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1549#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1550#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1599#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1600#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1601#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1580#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1581#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1597#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1596#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1595#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1594#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1593#L517-4 lis_~i~0#1 := 1; 1591#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1592#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1615#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1613#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1612#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1602#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1562#L519-2 [2022-11-20 10:48:26,249 INFO L750 eck$LassoCheckResult]: Loop: 1562#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1563#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1553#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1554#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1574#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1559#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1572#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1562#L519-2 [2022-11-20 10:48:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2022-11-20 10:48:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:26,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978558524] [2022-11-20 10:48:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:26,419 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:48:26,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:26,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978558524] [2022-11-20 10:48:26,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978558524] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:48:26,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691379581] [2022-11-20 10:48:26,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:26,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:48:26,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:26,427 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:48:26,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-11-20 10:48:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:26,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 10:48:26,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:48:26,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:48:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:48:26,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691379581] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:48:26,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:48:26,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-20 10:48:26,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393903528] [2022-11-20 10:48:26,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:48:26,721 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:48:26,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 4 times [2022-11-20 10:48:26,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:26,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804551392] [2022-11-20 10:48:26,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:26,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:26,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:26,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:27,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:27,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:48:27,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:48:27,008 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. cyclomatic complexity: 28 Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:48:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:27,266 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2022-11-20 10:48:27,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 99 transitions. [2022-11-20 10:48:27,267 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-11-20 10:48:27,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 99 transitions. [2022-11-20 10:48:27,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-11-20 10:48:27,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-11-20 10:48:27,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 99 transitions. [2022-11-20 10:48:27,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:48:27,268 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-11-20 10:48:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 99 transitions. [2022-11-20 10:48:27,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2022-11-20 10:48:27,271 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) [2022-11-20 10:48:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-11-20 10:48:27,272 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-11-20 10:48:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:48:27,273 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-11-20 10:48:27,273 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-20 10:48:27,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2022-11-20 10:48:27,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-11-20 10:48:27,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:27,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:27,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:27,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-20 10:48:27,275 INFO L748 eck$LassoCheckResult]: Stem: 1863#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1864#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1878#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1869#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1859#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1860#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1861#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1862#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1902#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1904#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1914#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1913#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1912#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1911#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1910#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1898#L517-4 lis_~i~0#1 := 1; 1881#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1882#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1889#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1890#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1871#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1927#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1926#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1919#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 1899#L519-4 lis_~i~0#1 := 0; 1893#L523-3 [2022-11-20 10:48:27,276 INFO L750 eck$LassoCheckResult]: Loop: 1893#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 1894#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 1895#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 1893#L523-3 [2022-11-20 10:48:27,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2022-11-20 10:48:27,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:27,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357146534] [2022-11-20 10:48:27,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:27,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:27,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:27,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:27,347 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 2 times [2022-11-20 10:48:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:27,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114645522] [2022-11-20 10:48:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:27,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:27,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:27,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:27,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:27,356 INFO L85 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2022-11-20 10:48:27,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:27,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93423772] [2022-11-20 10:48:27,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:27,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:27,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:27,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:32,875 WARN L233 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 261 DAG size of output: 187 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 10:48:34,656 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 10:48:34,656 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 10:48:34,656 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 10:48:34,656 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 10:48:34,656 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 10:48:34,656 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:34,657 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 10:48:34,657 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 10:48:34,657 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration11_Lasso [2022-11-20 10:48:34,657 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 10:48:34,657 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 10:48:34,662 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:34,664 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:34,667 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:34,669 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:34,672 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:34,675 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:34,677 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:34,680 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:34,683 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:34,685 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:34,688 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:37,095 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:37,097 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:37,100 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:37,102 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:37,104 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:37,126 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:37,131 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:37,141 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:37,152 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:37,154 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:37,156 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:37,158 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:37,160 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:38,208 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 10:48:38,209 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 10:48:38,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:38,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:38,219 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:38,228 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 [2022-11-20 10:48:38,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-11-20 10:48:38,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:38,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:38,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:38,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:38,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:38,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:38,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:38,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:38,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:38,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:38,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:38,257 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:38,267 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 [2022-11-20 10:48:38,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-11-20 10:48:38,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:38,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:38,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:38,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:38,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:38,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:38,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:38,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:38,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-11-20 10:48:38,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:38,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:38,285 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:38,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-11-20 10:48:38,289 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 [2022-11-20 10:48:38,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:38,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:38,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:38,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:38,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:38,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:38,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:38,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:38,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:38,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:38,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:38,306 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:38,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-11-20 10:48:38,308 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 [2022-11-20 10:48:38,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:38,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:38,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:38,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:38,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:38,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:38,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:38,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:38,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:38,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:38,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:38,325 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:38,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-11-20 10:48:38,327 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 [2022-11-20 10:48:38,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:38,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:38,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:38,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:38,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:38,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:38,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:38,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:38,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:38,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:38,355 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:38,363 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 [2022-11-20 10:48:38,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-11-20 10:48:38,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:38,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:38,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:38,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:38,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:38,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:38,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:38,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:38,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:38,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:38,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:38,399 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:38,403 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 [2022-11-20 10:48:38,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-11-20 10:48:38,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:38,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:38,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:38,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:38,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:38,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:38,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:38,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:38,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:38,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:38,442 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:38,447 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 [2022-11-20 10:48:38,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-11-20 10:48:38,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:38,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:38,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:38,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:38,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:38,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:38,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:38,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:38,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:38,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:38,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:38,482 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:38,487 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 [2022-11-20 10:48:38,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-11-20 10:48:38,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:38,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:38,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:38,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:38,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:38,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:38,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:38,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:38,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:38,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:38,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:38,520 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:38,527 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 [2022-11-20 10:48:38,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-11-20 10:48:38,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:38,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:48:38,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:38,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:38,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:38,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:48:38,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:48:38,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:38,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-11-20 10:48:38,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:38,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:38,561 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:38,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-11-20 10:48:38,566 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 [2022-11-20 10:48:38,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:38,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:38,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:38,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:38,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:38,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:38,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:48:38,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:38,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:38,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:38,587 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:38,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-11-20 10:48:38,591 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 [2022-11-20 10:48:38,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:48:38,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:48:38,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:48:38,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:48:38,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:48:38,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:48:38,676 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 10:48:38,764 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2022-11-20 10:48:38,764 INFO L444 ModelExtractionUtils]: 10 out of 67 variables were initially zero. Simplification set additionally 54 variables to zero. [2022-11-20 10:48:38,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:38,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:38,770 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:38,776 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 10:48:38,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-11-20 10:48:38,812 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-20 10:48:38,812 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 10:48:38,813 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~N#1, ULTIMATE.start_lis_~i~0#1) = 1*ULTIMATE.start_lis_~N#1 - 1*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2022-11-20 10:48:38,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:39,181 INFO L156 tatePredicateManager]: 45 out of 45 supporting invariants were superfluous and have been removed [2022-11-20 10:48:39,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:39,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 10:48:39,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:39,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:48:39,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:48:39,317 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-20 10:48:39,317 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 93 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:48:39,330 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 93 transitions. cyclomatic complexity: 28. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 74 states and 98 transitions. Complement of second has 4 states. [2022-11-20 10:48:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-11-20 10:48:39,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:48:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-11-20 10:48:39,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 25 letters. Loop has 3 letters. [2022-11-20 10:48:39,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:48:39,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 28 letters. Loop has 3 letters. [2022-11-20 10:48:39,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:48:39,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 25 letters. Loop has 6 letters. [2022-11-20 10:48:39,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:48:39,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 98 transitions. [2022-11-20 10:48:39,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-11-20 10:48:39,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 51 states and 66 transitions. [2022-11-20 10:48:39,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-11-20 10:48:39,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-11-20 10:48:39,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2022-11-20 10:48:39,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:48:39,335 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-11-20 10:48:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2022-11-20 10:48:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-20 10:48:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 50 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:48:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2022-11-20 10:48:39,338 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-11-20 10:48:39,338 INFO L428 stractBuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-11-20 10:48:39,338 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-20 10:48:39,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 66 transitions. [2022-11-20 10:48:39,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-11-20 10:48:39,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:39,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:39,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:39,340 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:39,340 INFO L748 eck$LassoCheckResult]: Stem: 2291#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2292#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2306#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2297#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2287#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2288#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2289#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2290#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2327#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2324#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2323#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2318#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2319#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2307#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2308#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2322#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2328#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2326#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2325#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2320#L517-4 lis_~i~0#1 := 1; 2321#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2331#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2335#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2330#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2299#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2311#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2302#L519-2 [2022-11-20 10:48:39,340 INFO L750 eck$LassoCheckResult]: Loop: 2302#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2303#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2293#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2294#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2314#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2333#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2332#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2302#L519-2 [2022-11-20 10:48:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:39,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 2 times [2022-11-20 10:48:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:39,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80888915] [2022-11-20 10:48:39,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:39,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:39,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:39,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:39,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 5 times [2022-11-20 10:48:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:39,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216516770] [2022-11-20 10:48:39,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:39,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:39,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:39,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1635630457, now seen corresponding path program 1 times [2022-11-20 10:48:39,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:39,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302480358] [2022-11-20 10:48:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:39,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:39,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:48:39,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:39,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302480358] [2022-11-20 10:48:39,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302480358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:48:39,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649405957] [2022-11-20 10:48:39,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:39,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:48:39,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:39,671 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:48:39,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-11-20 10:48:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:39,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:48:39,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:48:39,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:48:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:48:39,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649405957] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:48:39,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:48:39,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-20 10:48:39,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610922864] [2022-11-20 10:48:39,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:48:40,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:40,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:48:40,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:48:40,131 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. cyclomatic complexity: 19 Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:48:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:40,242 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-11-20 10:48:40,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 90 transitions. [2022-11-20 10:48:40,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-11-20 10:48:40,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 56 transitions. [2022-11-20 10:48:40,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-11-20 10:48:40,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2022-11-20 10:48:40,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2022-11-20 10:48:40,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:48:40,244 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-11-20 10:48:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2022-11-20 10:48:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-11-20 10:48:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 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) [2022-11-20 10:48:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-11-20 10:48:40,246 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-11-20 10:48:40,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:48:40,255 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-11-20 10:48:40,255 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-20 10:48:40,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2022-11-20 10:48:40,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-11-20 10:48:40,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:48:40,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:48:40,257 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:40,257 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2022-11-20 10:48:40,257 INFO L748 eck$LassoCheckResult]: Stem: 2622#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2623#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2632#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2626#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2618#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2619#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2620#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2621#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2631#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2647#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2646#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2639#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2640#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2633#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2634#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2642#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2645#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2644#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2643#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2641#L517-4 lis_~i~0#1 := 1; 2635#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2636#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2657#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2655#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2654#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2648#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2629#L519-2 [2022-11-20 10:48:40,257 INFO L750 eck$LassoCheckResult]: Loop: 2629#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2630#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2653#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2652#L521 assume !lis_#t~short11#1; 2650#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2637#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2624#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2625#L521 assume !lis_#t~short11#1; 2627#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2628#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2649#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2629#L519-2 [2022-11-20 10:48:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 3 times [2022-11-20 10:48:40,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:40,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910812356] [2022-11-20 10:48:40,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:40,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:40,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:40,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1752732867, now seen corresponding path program 1 times [2022-11-20 10:48:40,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:40,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228525770] [2022-11-20 10:48:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:40,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:40,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:40,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:40,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:40,380 INFO L85 PathProgramCache]: Analyzing trace with hash 117015998, now seen corresponding path program 1 times [2022-11-20 10:48:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:40,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079863226] [2022-11-20 10:48:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:40,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:40,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:48:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:48:40,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:48:51,525 WARN L233 SmtUtils]: Spent 10.86s on a formula simplification. DAG size of input: 290 DAG size of output: 205 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 10:48:55,357 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 10:48:55,357 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 10:48:55,357 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 10:48:55,357 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 10:48:55,358 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 10:48:55,358 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:48:55,358 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 10:48:55,358 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 10:48:55,358 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration13_Lasso [2022-11-20 10:48:55,358 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 10:48:55,358 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 10:48:55,371 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:55,375 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:55,378 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:55,381 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:55,384 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:55,386 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:48:55,390 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,928 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,931 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,934 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,939 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,941 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,943 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,945 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,947 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,949 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,953 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,955 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,968 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,970 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,973 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,976 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,977 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,979 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:00,981 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 10:49:01,973 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 10:49:01,973 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 10:49:01,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:49:01,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:01,978 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:49:01,984 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 [2022-11-20 10:49:01,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-11-20 10:49:01,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:49:01,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:49:01,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:49:01,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:49:01,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:49:01,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:49:01,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:49:01,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:49:02,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-11-20 10:49:02,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:49:02,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:02,001 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:49:02,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-11-20 10:49:02,003 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 [2022-11-20 10:49:02,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:49:02,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:49:02,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:49:02,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:49:02,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:49:02,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:49:02,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:49:02,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-11-20 10:49:02,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:49:02,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:02,024 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:49:02,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-11-20 10:49:02,029 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 [2022-11-20 10:49:02,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:49:02,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:49:02,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:49:02,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:49:02,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:49:02,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:49:02,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:49:02,042 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:49:02,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-11-20 10:49:02,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:49:02,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:02,049 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:49:02,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-11-20 10:49:02,051 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 [2022-11-20 10:49:02,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:49:02,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:49:02,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:49:02,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:49:02,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:49:02,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:49:02,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:49:02,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:49:02,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-11-20 10:49:02,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:49:02,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:02,070 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:49:02,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-11-20 10:49:02,073 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 [2022-11-20 10:49:02,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:49:02,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 10:49:02,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:49:02,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:49:02,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:49:02,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 10:49:02,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 10:49:02,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:49:02,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-11-20 10:49:02,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:49:02,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:02,090 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:49:02,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-11-20 10:49:02,092 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 [2022-11-20 10:49:02,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:49:02,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:49:02,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:49:02,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:49:02,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:49:02,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:49:02,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 10:49:02,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-11-20 10:49:02,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:49:02,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:02,113 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:49:02,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-11-20 10:49:02,115 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 [2022-11-20 10:49:02,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 10:49:02,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 10:49:02,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 10:49:02,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 10:49:02,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 10:49:02,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 10:49:02,139 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 10:49:02,149 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-11-20 10:49:02,149 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-11-20 10:49:02,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 10:49:02,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:02,153 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 10:49:02,155 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 10:49:02,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-11-20 10:49:02,168 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2022-11-20 10:49:02,169 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 10:49:02,169 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset (* ULTIMATE.start_lis_~i~0#1 4)))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset (* ULTIMATE.start_lis_~i~0#1 4)))_2 + 1 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset 4))_2 >= 0, 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset 8))_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset 4))_2 - 2 >= 0] [2022-11-20 10:49:02,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-11-20 10:49:02,603 INFO L156 tatePredicateManager]: 47 out of 49 supporting invariants were superfluous and have been removed [2022-11-20 10:49:02,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:02,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 10:49:02,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:49:02,904 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-20 10:49:02,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-20 10:49:02,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-20 10:49:02,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-20 10:49:03,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 21 [2022-11-20 10:49:03,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 10:49:03,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-11-20 10:49:03,630 INFO L321 Elim1Store]: treesize reduction 23, result has 43.9 percent of original size [2022-11-20 10:49:03,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 96 [2022-11-20 10:49:03,670 INFO L321 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-11-20 10:49:03,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 51 [2022-11-20 10:49:03,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:49:03,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-20 10:49:03,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:03,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:03,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:03,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:03,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:03,833 INFO L321 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2022-11-20 10:49:03,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 134 [2022-11-20 10:49:03,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:03,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:03,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:03,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:03,922 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-11-20 10:49:03,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 43 [2022-11-20 10:50:39,713 WARN L233 SmtUtils]: Spent 1.59m on a formula simplification. DAG size of input: 88 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:50:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:39,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 10:50:39,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:50:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:50:40,290 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 6 loop predicates [2022-11-20 10:50:40,290 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:40,292 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 49 transitions. Complement of second has 2 states. [2022-11-20 10:50:40,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 1 states 1 stem states 0 non-accepting loop states 0 accepting loop states [2022-11-20 10:50:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1 states to 1 states and 4 transitions. [2022-11-20 10:50:40,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1 states and 4 transitions. Stem has 26 letters. Loop has 11 letters. [2022-11-20 10:50:40,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:50:40,293 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-20 10:50:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:50:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:40,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 10:50:40,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:50:40,585 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-20 10:50:40,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-20 10:50:40,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-20 10:50:40,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-20 10:50:40,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 19 [2022-11-20 10:50:40,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:50:41,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:41,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:41,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:41,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:41,107 INFO L321 Elim1Store]: treesize reduction 19, result has 50.0 percent of original size [2022-11-20 10:50:41,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 68 [2022-11-20 10:50:41,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 10:50:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:41,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 10:50:41,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:50:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:50:41,561 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 6 loop predicates [2022-11-20 10:50:41,561 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:41,652 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 51 transitions. Complement of second has 4 states. [2022-11-20 10:50:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-11-20 10:50:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-11-20 10:50:41,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 26 letters. Loop has 11 letters. [2022-11-20 10:50:41,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:50:41,657 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-20 10:50:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:50:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:41,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 10:50:41,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:50:41,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 10:50:41,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:41,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-20 10:50:41,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-20 10:50:42,122 INFO L321 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2022-11-20 10:50:42,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2022-11-20 10:50:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:42,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 10:50:42,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:50:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:50:42,605 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 6 loop predicates [2022-11-20 10:50:42,605 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:42,882 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 76 states and 98 transitions. Complement of second has 13 states. [2022-11-20 10:50:42,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 8 stem states 0 non-accepting loop states 1 accepting loop states [2022-11-20 10:50:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-11-20 10:50:42,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 26 letters. Loop has 11 letters. [2022-11-20 10:50:42,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:50:42,885 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-20 10:50:42,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:50:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:42,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 10:50:42,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:50:43,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 10:50:43,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:43,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-20 10:50:43,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-20 10:50:43,370 INFO L321 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2022-11-20 10:50:43,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2022-11-20 10:50:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:43,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 10:50:43,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:50:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:50:43,840 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.8 stem predicates 6 loop predicates [2022-11-20 10:50:43,840 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:44,075 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 12. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 76 states and 98 transitions. Complement of second has 13 states. [2022-11-20 10:50:44,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 8 stem states 0 non-accepting loop states 1 accepting loop states [2022-11-20 10:50:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-11-20 10:50:44,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 26 letters. Loop has 11 letters. [2022-11-20 10:50:44,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:50:44,079 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-20 10:50:44,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:50:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:44,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 10:50:44,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:50:44,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 10:50:44,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:44,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-20 10:50:44,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-20 10:50:44,580 INFO L321 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2022-11-20 10:50:44,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2022-11-20 10:50:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:44,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 10:50:44,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:50:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:50:45,122 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.8 stem predicates 6 loop predicates [2022-11-20 10:50:45,123 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:45,958 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 608 states and 955 transitions. Complement of second has 107 states 25 powerset states82 rank states. The highest rank that occured is 5 [2022-11-20 10:50:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 8 stem states 8 non-accepting loop states 2 accepting loop states [2022-11-20 10:50:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 160 transitions. [2022-11-20 10:50:45,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 160 transitions. Stem has 26 letters. Loop has 11 letters. [2022-11-20 10:50:45,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:50:45,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 160 transitions. Stem has 37 letters. Loop has 11 letters. [2022-11-20 10:50:45,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:50:45,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 160 transitions. Stem has 26 letters. Loop has 22 letters. [2022-11-20 10:50:45,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 10:50:45,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 955 transitions. [2022-11-20 10:50:45,968 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 102 [2022-11-20 10:50:45,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 572 states and 906 transitions. [2022-11-20 10:50:45,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2022-11-20 10:50:45,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 345 [2022-11-20 10:50:45,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 572 states and 906 transitions. [2022-11-20 10:50:45,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:50:45,975 INFO L218 hiAutomatonCegarLoop]: Abstraction has 572 states and 906 transitions. [2022-11-20 10:50:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states and 906 transitions. [2022-11-20 10:50:45,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 173. [2022-11-20 10:50:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 173 states have (on average 1.699421965317919) internal successors, (294), 172 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:50:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 294 transitions. [2022-11-20 10:50:45,985 INFO L240 hiAutomatonCegarLoop]: Abstraction has 173 states and 294 transitions. [2022-11-20 10:50:45,985 INFO L428 stractBuchiCegarLoop]: Abstraction has 173 states and 294 transitions. [2022-11-20 10:50:45,985 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-20 10:50:45,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 294 transitions. [2022-11-20 10:50:45,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-11-20 10:50:45,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:50:45,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:50:45,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:50:45,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2022-11-20 10:50:45,988 INFO L748 eck$LassoCheckResult]: Stem: 4506#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 4528#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4551#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 4503#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4504#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4525#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4582#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4574#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4580#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4570#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4556#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 4547#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4548#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4562#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4529#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4530#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4585#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4555#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 4543#L517-4 lis_~i~0#1 := 1; 4544#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4609#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4599#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4608#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4592#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4666#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4521#L519-2 [2022-11-20 10:50:45,988 INFO L750 eck$LassoCheckResult]: Loop: 4521#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4522#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4533#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4513#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4537#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4639#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4638#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4619#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4614#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4611#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4605#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4521#L519-2 [2022-11-20 10:50:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:50:45,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1035301794, now seen corresponding path program 1 times [2022-11-20 10:50:45,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:50:45,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396083483] [2022-11-20 10:50:45,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:50:45,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:50:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:50:47,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:50:47,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396083483] [2022-11-20 10:50:47,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396083483] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:50:47,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514088234] [2022-11-20 10:50:47,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:50:47,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:50:47,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:50:47,855 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:50:47,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-11-20 10:50:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:48,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-20 10:50:48,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:50:48,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 10:50:48,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-20 10:50:48,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 10:50:48,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-20 10:50:48,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-20 10:50:48,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:48,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:48,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:48,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-11-20 10:50:48,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-20 10:52:00,437 WARN L233 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:52:37,633 WARN L233 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:53:01,731 WARN L233 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:53:01,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:01,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:01,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:01,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 16 [2022-11-20 10:53:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:53:01,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:53:01,995 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_958 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2022-11-20 10:53:02,015 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_274| Int)) (or (forall ((v_ArrVal_958 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |v_ULTIMATE.start_lis_~i~0#1_274|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (not (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 1) |v_ULTIMATE.start_lis_~i~0#1_274|)))) is different from false [2022-11-20 10:53:02,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:02,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 146 [2022-11-20 10:53:02,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 256 [2022-11-20 10:53:02,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:02,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 310 treesize of output 300 [2022-11-20 10:53:02,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:02,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 343 treesize of output 319 [2022-11-20 10:53:02,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:02,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 373 [2022-11-20 10:53:02,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:02,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 300 treesize of output 276 [2022-11-20 10:53:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 5 not checked. [2022-11-20 10:53:02,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514088234] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:53:02,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:53:02,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 34 [2022-11-20 10:53:02,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909850765] [2022-11-20 10:53:02,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:53:02,929 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:53:02,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:02,929 INFO L85 PathProgramCache]: Analyzing trace with hash -943445823, now seen corresponding path program 6 times [2022-11-20 10:53:02,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:02,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678229241] [2022-11-20 10:53:02,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:02,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:02,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:53:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:02,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:53:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 10:53:03,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=831, Unknown=16, NotChecked=122, Total=1122 [2022-11-20 10:53:03,414 INFO L87 Difference]: Start difference. First operand 173 states and 294 transitions. cyclomatic complexity: 134 Second operand has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:53:16,357 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:53:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:18,737 INFO L93 Difference]: Finished difference Result 231 states and 393 transitions. [2022-11-20 10:53:18,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 393 transitions. [2022-11-20 10:53:18,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-11-20 10:53:18,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 231 states and 393 transitions. [2022-11-20 10:53:18,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2022-11-20 10:53:18,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2022-11-20 10:53:18,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 231 states and 393 transitions. [2022-11-20 10:53:18,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:53:18,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 231 states and 393 transitions. [2022-11-20 10:53:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 393 transitions. [2022-11-20 10:53:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 206. [2022-11-20 10:53:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 206 states have (on average 1.7184466019417475) internal successors, (354), 205 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:53:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 354 transitions. [2022-11-20 10:53:18,750 INFO L240 hiAutomatonCegarLoop]: Abstraction has 206 states and 354 transitions. [2022-11-20 10:53:18,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 10:53:18,751 INFO L428 stractBuchiCegarLoop]: Abstraction has 206 states and 354 transitions. [2022-11-20 10:53:18,751 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-20 10:53:18,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 354 transitions. [2022-11-20 10:53:18,752 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-11-20 10:53:18,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:53:18,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:53:18,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:18,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2022-11-20 10:53:18,754 INFO L748 eck$LassoCheckResult]: Stem: 5119#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5120#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 5139#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5167#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 5115#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5116#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5180#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5179#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5176#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5172#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5171#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5168#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 5164#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5165#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5214#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5265#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5209#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5262#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5200#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 5257#L517-4 lis_~i~0#1 := 1; 5162#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5255#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5252#L521 assume !lis_#t~short11#1; 5129#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5130#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5146#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5189#L519-2 [2022-11-20 10:53:18,754 INFO L750 eck$LassoCheckResult]: Loop: 5189#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 5279#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5278#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5276#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5152#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5282#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5122#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5123#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5273#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5271#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5269#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5189#L519-2 [2022-11-20 10:53:18,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:18,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1035361376, now seen corresponding path program 1 times [2022-11-20 10:53:18,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:18,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396047338] [2022-11-20 10:53:18,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:18,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:18,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:53:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:18,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:53:18,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:18,814 INFO L85 PathProgramCache]: Analyzing trace with hash -943445823, now seen corresponding path program 7 times [2022-11-20 10:53:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:18,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633084346] [2022-11-20 10:53:18,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:18,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:18,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:53:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:18,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:53:18,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1364677886, now seen corresponding path program 1 times [2022-11-20 10:53:18,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:18,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207862050] [2022-11-20 10:53:18,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:18,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:53:20,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:20,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207862050] [2022-11-20 10:53:20,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207862050] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:53:20,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695021903] [2022-11-20 10:53:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:20,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:20,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:53:20,943 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:53:20,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-11-20 10:53:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:21,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-20 10:53:21,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:53:21,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 10:53:21,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-20 10:53:21,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 10:53:21,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-20 10:53:21,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 10:53:21,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:21,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2022-11-20 10:53:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:53:21,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:53:22,354 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1063 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1063) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1)))) is different from false [2022-11-20 10:53:22,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:22,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 74 [2022-11-20 10:53:22,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2022-11-20 10:53:22,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:22,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 105 [2022-11-20 10:53:22,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:22,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 108 [2022-11-20 10:53:22,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:22,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 71 [2022-11-20 10:53:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-11-20 10:53:22,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695021903] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:53:22,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:53:22,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 39 [2022-11-20 10:53:22,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230293339] [2022-11-20 10:53:22,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:53:23,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:23,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 10:53:23,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1260, Unknown=4, NotChecked=72, Total=1482 [2022-11-20 10:53:23,103 INFO L87 Difference]: Start difference. First operand 206 states and 354 transitions. cyclomatic complexity: 161 Second operand has 39 states, 39 states have (on average 2.230769230769231) internal successors, (87), 39 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:53:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:29,375 INFO L93 Difference]: Finished difference Result 746 states and 1352 transitions. [2022-11-20 10:53:29,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 746 states and 1352 transitions. [2022-11-20 10:53:29,381 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 84 [2022-11-20 10:53:29,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 746 states to 746 states and 1352 transitions. [2022-11-20 10:53:29,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2022-11-20 10:53:29,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 299 [2022-11-20 10:53:29,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 746 states and 1352 transitions. [2022-11-20 10:53:29,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:53:29,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 746 states and 1352 transitions. [2022-11-20 10:53:29,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states and 1352 transitions. [2022-11-20 10:53:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 358. [2022-11-20 10:53:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 358 states have (on average 1.776536312849162) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:53:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 636 transitions. [2022-11-20 10:53:29,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 358 states and 636 transitions. [2022-11-20 10:53:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-20 10:53:29,401 INFO L428 stractBuchiCegarLoop]: Abstraction has 358 states and 636 transitions. [2022-11-20 10:53:29,401 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-20 10:53:29,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 358 states and 636 transitions. [2022-11-20 10:53:29,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-11-20 10:53:29,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:53:29,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:53:29,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:29,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2022-11-20 10:53:29,405 INFO L748 eck$LassoCheckResult]: Stem: 6423#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6424#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 6444#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6455#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 6419#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6420#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6442#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6491#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6421#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6422#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6475#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6477#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 6776#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6775#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6516#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6774#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6510#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6773#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6504#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6567#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6647#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 6464#L517-4 lis_~i~0#1 := 1; 6465#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6571#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6563#L521 assume !lis_#t~short11#1; 6557#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6628#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6531#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6438#L519-2 [2022-11-20 10:53:29,405 INFO L750 eck$LassoCheckResult]: Loop: 6438#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6439#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6454#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6622#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6620#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6617#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6606#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6430#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6649#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6435#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6448#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6438#L519-2 [2022-11-20 10:53:29,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:29,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1573780482, now seen corresponding path program 2 times [2022-11-20 10:53:29,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:29,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277598758] [2022-11-20 10:53:29,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:53:29,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:29,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277598758] [2022-11-20 10:53:29,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277598758] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:53:29,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124575422] [2022-11-20 10:53:29,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:53:29,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:29,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:53:29,630 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:53:29,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-11-20 10:53:29,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:53:29,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:53:29,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 10:53:29,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:53:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:53:29,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:53:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:53:30,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124575422] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:53:30,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:53:30,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-20 10:53:30,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848642169] [2022-11-20 10:53:30,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:53:30,042 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:53:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:30,043 INFO L85 PathProgramCache]: Analyzing trace with hash -943445823, now seen corresponding path program 8 times [2022-11-20 10:53:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:30,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529010127] [2022-11-20 10:53:30,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:30,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:30,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:53:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:30,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:53:30,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:30,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 10:53:30,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:53:30,503 INFO L87 Difference]: Start difference. First operand 358 states and 636 transitions. cyclomatic complexity: 293 Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:53:30,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:30,793 INFO L93 Difference]: Finished difference Result 443 states and 770 transitions. [2022-11-20 10:53:30,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 443 states and 770 transitions. [2022-11-20 10:53:30,797 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 31 [2022-11-20 10:53:30,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 443 states to 429 states and 743 transitions. [2022-11-20 10:53:30,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2022-11-20 10:53:30,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2022-11-20 10:53:30,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 429 states and 743 transitions. [2022-11-20 10:53:30,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:53:30,803 INFO L218 hiAutomatonCegarLoop]: Abstraction has 429 states and 743 transitions. [2022-11-20 10:53:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states and 743 transitions. [2022-11-20 10:53:30,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 367. [2022-11-20 10:53:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 367 states have (on average 1.7302452316076293) internal successors, (635), 366 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:53:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 635 transitions. [2022-11-20 10:53:30,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 367 states and 635 transitions. [2022-11-20 10:53:30,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:53:30,813 INFO L428 stractBuchiCegarLoop]: Abstraction has 367 states and 635 transitions. [2022-11-20 10:53:30,813 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-20 10:53:30,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 367 states and 635 transitions. [2022-11-20 10:53:30,815 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-11-20 10:53:30,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:53:30,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:53:30,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:30,816 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-20 10:53:30,817 INFO L748 eck$LassoCheckResult]: Stem: 7416#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7417#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 7437#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 7446#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 7475#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 7474#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 7472#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 7470#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 7469#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 7466#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 7467#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 7481#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 7510#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7506#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 7502#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7498#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 7494#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7493#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 7478#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 7455#L517-4 lis_~i~0#1 := 1; 7456#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 7705#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 7702#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 7704#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7529#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 7515#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 7430#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 7431#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 7419#L520-3 [2022-11-20 10:53:30,817 INFO L750 eck$LassoCheckResult]: Loop: 7419#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 7420#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 7447#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 7443#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 7419#L520-3 [2022-11-20 10:53:30,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:30,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1509233465, now seen corresponding path program 1 times [2022-11-20 10:53:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:30,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485020562] [2022-11-20 10:53:30,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:30,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:30,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:53:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:30,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:53:30,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 2 times [2022-11-20 10:53:30,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:30,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39836565] [2022-11-20 10:53:30,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:30,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:30,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:53:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:30,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:53:30,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:30,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1715330260, now seen corresponding path program 2 times [2022-11-20 10:53:30,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:30,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884248135] [2022-11-20 10:53:30,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:53:33,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:33,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884248135] [2022-11-20 10:53:33,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884248135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:53:33,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097137327] [2022-11-20 10:53:33,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:53:33,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:33,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:53:33,339 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:53:33,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-11-20 10:53:33,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:53:33,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:53:33,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 10:53:33,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:53:33,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 10:53:33,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-20 10:53:33,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 10:53:33,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-20 10:53:33,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 10:53:34,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:34,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:34,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:34,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:53:34,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2022-11-20 10:53:34,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2022-11-20 10:53:34,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:34,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 18 [2022-11-20 10:53:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:53:34,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:53:35,628 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1256 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1256)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1257))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (or (< .cse0 (select .cse1 .cse2)) (let ((.cse3 (select (store (store .cse4 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 .cse2 (+ .cse0 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1258) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (not (<= v_ArrVal_1256 1))))))) is different from false [2022-11-20 10:53:35,652 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1256 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1256)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1257))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (or (< .cse0 (select .cse1 .cse2)) (let ((.cse3 (select (store (store .cse4 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 .cse2 (+ .cse0 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1258) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (not (<= v_ArrVal_1256 1))))))) is different from false [2022-11-20 10:53:35,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:35,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 435 treesize of output 255 [2022-11-20 10:53:35,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 297 [2022-11-20 10:53:35,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 200 [2022-11-20 10:53:35,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 186 [2022-11-20 10:53:35,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 275 [2022-11-20 10:53:35,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:35,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 210 [2022-11-20 10:53:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 5 not checked. [2022-11-20 10:53:36,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097137327] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:53:36,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:53:36,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 14] total 45 [2022-11-20 10:53:36,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145127784] [2022-11-20 10:53:36,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:53:36,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:36,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 10:53:36,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1652, Unknown=2, NotChecked=166, Total=1980 [2022-11-20 10:53:36,424 INFO L87 Difference]: Start difference. First operand 367 states and 635 transitions. cyclomatic complexity: 285 Second operand has 45 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:53:43,708 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 89 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:53:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:47,628 INFO L93 Difference]: Finished difference Result 582 states and 1032 transitions. [2022-11-20 10:53:47,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 582 states and 1032 transitions. [2022-11-20 10:53:47,632 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 76 [2022-11-20 10:53:47,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 582 states to 578 states and 1024 transitions. [2022-11-20 10:53:47,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 236 [2022-11-20 10:53:47,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2022-11-20 10:53:47,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 1024 transitions. [2022-11-20 10:53:47,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:53:47,637 INFO L218 hiAutomatonCegarLoop]: Abstraction has 578 states and 1024 transitions. [2022-11-20 10:53:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 1024 transitions. [2022-11-20 10:53:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 397. [2022-11-20 10:53:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 397 states have (on average 1.6926952141057934) internal successors, (672), 396 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:53:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 672 transitions. [2022-11-20 10:53:47,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 397 states and 672 transitions. [2022-11-20 10:53:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-20 10:53:47,668 INFO L428 stractBuchiCegarLoop]: Abstraction has 397 states and 672 transitions. [2022-11-20 10:53:47,668 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-20 10:53:47,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 397 states and 672 transitions. [2022-11-20 10:53:47,673 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-11-20 10:53:47,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:53:47,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:53:47,675 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:47,675 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-20 10:53:47,675 INFO L748 eck$LassoCheckResult]: Stem: 8676#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8677#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 8698#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 8709#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 8672#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 8673#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8741#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 8779#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8674#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 8675#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8734#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 8744#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 8748#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 8785#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 8725#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8726#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8770#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8862#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8763#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8791#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8753#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 8861#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 8903#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 8897#L517-4 lis_~i~0#1 := 1; 8852#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 8853#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 8877#L521 assume !lis_#t~short11#1; 8842#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 8868#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8793#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 8691#L519-2 [2022-11-20 10:53:47,675 INFO L750 eck$LassoCheckResult]: Loop: 8691#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 8692#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 9010#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 9008#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 9005#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 9001#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8996#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 8992#L521 assume !lis_#t~short11#1; 8866#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 8867#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 8994#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 8691#L519-2 [2022-11-20 10:53:47,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash -11169052, now seen corresponding path program 3 times [2022-11-20 10:53:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:47,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918545641] [2022-11-20 10:53:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:47,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:47,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:53:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:47,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:53:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash -943386241, now seen corresponding path program 1 times [2022-11-20 10:53:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:47,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332205558] [2022-11-20 10:53:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:47,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:47,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:53:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:47,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:53:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:47,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1948639932, now seen corresponding path program 2 times [2022-11-20 10:53:47,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:47,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844355] [2022-11-20 10:53:47,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:47,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-20 10:53:48,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:48,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844355] [2022-11-20 10:53:48,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844355] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:53:48,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273477142] [2022-11-20 10:53:48,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:53:48,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:48,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:53:48,806 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:53:48,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-11-20 10:53:48,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:53:48,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:53:48,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-20 10:53:48,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:53:49,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 10:53:49,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-20 10:53:49,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 10:53:49,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-20 10:53:49,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-20 10:53:49,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-11-20 10:53:49,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-20 10:53:49,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:49,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:49,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:49,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:49,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:49,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2022-11-20 10:53:49,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-20 10:53:49,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:53:49,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 16 [2022-11-20 10:53:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:53:49,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:53:50,119 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1391 Int) (v_ArrVal_1392 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1391)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2022-11-20 10:53:50,136 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_318| Int)) (or (not (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 1) |v_ULTIMATE.start_lis_~i~0#1_318|)) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1392 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |v_ULTIMATE.start_lis_~i~0#1_318|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1391)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))))) is different from false [2022-11-20 10:54:24,853 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1389 Int) (v_ArrVal_1386 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_318| Int) (v_ArrVal_1392 (Array Int Int))) (or (not (<= (+ 3 |c_ULTIMATE.start_lis_~i~0#1|) |v_ULTIMATE.start_lis_~i~0#1_318|)) (let ((.cse0 (select (store (let ((.cse1 (store (let ((.cse3 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse3 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1386))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse3 8 |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1389)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1390))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |v_ULTIMATE.start_lis_~i~0#1_318|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1391))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1392) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (not (<= v_ArrVal_1389 1)))) is different from false [2022-11-20 10:54:24,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:54:24,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 477 treesize of output 298 [2022-11-20 10:54:24,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 550 treesize of output 544 [2022-11-20 10:54:24,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1648 treesize of output 1552 [2022-11-20 10:54:25,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1416 treesize of output 1368 [2022-11-20 10:54:25,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1540 treesize of output 1492 [2022-11-20 10:54:25,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:54:25,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2908 treesize of output 2826 [2022-11-20 10:54:25,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:54:25,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17800 treesize of output 17032 [2022-11-20 10:55:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 11 refuted. 1 times theorem prover too weak. 19 trivial. 9 not checked. [2022-11-20 10:55:12,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273477142] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:55:12,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:55:12,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 39 [2022-11-20 10:55:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399029192] [2022-11-20 10:55:12,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:55:12,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:12,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 10:55:12,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1105, Unknown=27, NotChecked=210, Total=1482 [2022-11-20 10:55:12,951 INFO L87 Difference]: Start difference. First operand 397 states and 672 transitions. cyclomatic complexity: 292 Second operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:28,401 INFO L93 Difference]: Finished difference Result 703 states and 1252 transitions. [2022-11-20 10:55:28,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 703 states and 1252 transitions. [2022-11-20 10:55:28,407 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 94 [2022-11-20 10:55:28,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 703 states to 703 states and 1252 transitions. [2022-11-20 10:55:28,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 310 [2022-11-20 10:55:28,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 310 [2022-11-20 10:55:28,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 703 states and 1252 transitions. [2022-11-20 10:55:28,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:55:28,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 703 states and 1252 transitions. [2022-11-20 10:55:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states and 1252 transitions. [2022-11-20 10:55:28,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 522. [2022-11-20 10:55:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 522 states have (on average 1.7241379310344827) internal successors, (900), 521 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 900 transitions. [2022-11-20 10:55:28,426 INFO L240 hiAutomatonCegarLoop]: Abstraction has 522 states and 900 transitions. [2022-11-20 10:55:28,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-11-20 10:55:28,427 INFO L428 stractBuchiCegarLoop]: Abstraction has 522 states and 900 transitions. [2022-11-20 10:55:28,427 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-11-20 10:55:28,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 522 states and 900 transitions. [2022-11-20 10:55:28,430 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 46 [2022-11-20 10:55:28,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:28,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:28,431 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:28,431 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-20 10:55:28,432 INFO L748 eck$LassoCheckResult]: Stem: 10179#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10180#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 10201#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 10207#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 10175#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 10176#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 10177#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 10178#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 10241#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 10265#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 10237#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 10248#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 10260#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 10273#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 10253#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 10254#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 10263#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 10269#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 10274#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 10296#L517-4 lis_~i~0#1 := 1; 10366#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 10365#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 10360#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 10358#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 10351#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 10309#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 10310#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 10524#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 10523#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 10522#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 10456#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 10447#L520-2 [2022-11-20 10:55:28,432 INFO L750 eck$LassoCheckResult]: Loop: 10447#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 10444#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 10459#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 10453#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 10447#L520-2 [2022-11-20 10:55:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1856448556, now seen corresponding path program 2 times [2022-11-20 10:55:28,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:28,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784706736] [2022-11-20 10:55:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:28,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:28,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:28,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:28,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:28,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2942460, now seen corresponding path program 3 times [2022-11-20 10:55:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:28,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817846144] [2022-11-20 10:55:28,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:28,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:28,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:28,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:28,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash 115317839, now seen corresponding path program 3 times [2022-11-20 10:55:28,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:28,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224854771] [2022-11-20 10:55:28,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:28,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:55:29,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:29,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224854771] [2022-11-20 10:55:29,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224854771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:29,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332770056] [2022-11-20 10:55:29,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:55:29,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:29,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:29,943 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:29,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-11-20 10:55:30,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 10:55:30,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:55:30,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-20 10:55:30,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:30,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 10:55:30,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:30,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2022-11-20 10:55:30,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-20 10:55:30,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:55:30,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:30,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:30,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:30,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2022-11-20 10:55:30,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2022-11-20 10:55:30,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:30,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:30,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:55:30,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 17 [2022-11-20 10:55:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:55:30,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:55:30,931 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1530 (Array Int Int))) (let ((.cse1 (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (store .cse2 .cse1 (+ (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1530) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 .cse1) (+ (select .cse0 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))))) is different from false [2022-11-20 10:55:31,184 INFO L321 Elim1Store]: treesize reduction 22, result has 62.1 percent of original size [2022-11-20 10:55:31,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 115 [2022-11-20 10:55:31,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 127 [2022-11-20 10:55:31,211 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-11-20 10:55:31,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 85 [2022-11-20 10:55:31,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:55:31,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-11-20 10:55:31,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:55:31,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 104 [2022-11-20 10:55:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-11-20 10:55:31,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332770056] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:55:31,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:55:31,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 29 [2022-11-20 10:55:31,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629512658] [2022-11-20 10:55:31,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:55:31,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:31,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 10:55:31,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=676, Unknown=11, NotChecked=54, Total=870 [2022-11-20 10:55:31,947 INFO L87 Difference]: Start difference. First operand 522 states and 900 transitions. cyclomatic complexity: 401 Second operand has 30 states, 29 states have (on average 2.413793103448276) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:33,079 INFO L93 Difference]: Finished difference Result 598 states and 1040 transitions. [2022-11-20 10:55:33,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 598 states and 1040 transitions. [2022-11-20 10:55:33,083 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 70 [2022-11-20 10:55:33,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 598 states to 598 states and 1040 transitions. [2022-11-20 10:55:33,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 259 [2022-11-20 10:55:33,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2022-11-20 10:55:33,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 598 states and 1040 transitions. [2022-11-20 10:55:33,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:55:33,110 INFO L218 hiAutomatonCegarLoop]: Abstraction has 598 states and 1040 transitions. [2022-11-20 10:55:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states and 1040 transitions. [2022-11-20 10:55:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 558. [2022-11-20 10:55:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 558 states have (on average 1.7419354838709677) internal successors, (972), 557 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 972 transitions. [2022-11-20 10:55:33,123 INFO L240 hiAutomatonCegarLoop]: Abstraction has 558 states and 972 transitions. [2022-11-20 10:55:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:55:33,124 INFO L428 stractBuchiCegarLoop]: Abstraction has 558 states and 972 transitions. [2022-11-20 10:55:33,124 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-11-20 10:55:33,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 558 states and 972 transitions. [2022-11-20 10:55:33,127 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 63 [2022-11-20 10:55:33,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:33,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:33,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:33,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-20 10:55:33,132 INFO L748 eck$LassoCheckResult]: Stem: 11563#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11564#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 11582#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 11593#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 11559#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 11560#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 11580#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 11633#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 11621#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 11653#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 11617#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 11652#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 11643#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 11584#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 11585#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 11655#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 11646#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 11647#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 11648#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 11603#L517-4 lis_~i~0#1 := 1; 11604#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 11776#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 11771#L521 assume !lis_#t~short11#1; 11767#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 11814#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12079#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 12035#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 12070#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 12067#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12061#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 11598#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 12043#L520-2 [2022-11-20 10:55:33,132 INFO L750 eck$LassoCheckResult]: Loop: 12043#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 12050#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 12049#L521 assume !lis_#t~short11#1; 12054#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 12043#L520-2 [2022-11-20 10:55:33,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1985736812, now seen corresponding path program 2 times [2022-11-20 10:55:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:33,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278730163] [2022-11-20 10:55:33,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:33,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:33,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:33,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:33,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:33,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2942522, now seen corresponding path program 1 times [2022-11-20 10:55:33,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:33,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201508359] [2022-11-20 10:55:33,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:33,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:33,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:33,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:33,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:33,206 INFO L85 PathProgramCache]: Analyzing trace with hash -213322675, now seen corresponding path program 3 times [2022-11-20 10:55:33,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:33,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452227305] [2022-11-20 10:55:33,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:33,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:55:34,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:34,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452227305] [2022-11-20 10:55:34,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452227305] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:34,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31498674] [2022-11-20 10:55:34,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:55:34,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:34,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:34,649 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:34,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-11-20 10:55:34,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 10:55:34,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:55:34,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-20 10:55:34,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:34,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:55:34,910 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 10:55:34,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 10:55:35,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:55:35,888 INFO L321 Elim1Store]: treesize reduction 67, result has 14.1 percent of original size [2022-11-20 10:55:35,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 72 [2022-11-20 10:55:35,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 65 [2022-11-20 10:55:36,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:36,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:36,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:36,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:36,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:36,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:55:36,159 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 10:55:36,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 20 [2022-11-20 10:55:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:55:36,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:55:37,487 INFO L321 Elim1Store]: treesize reduction 199, result has 46.5 percent of original size [2022-11-20 10:55:37,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 98 treesize of output 206 [2022-11-20 10:55:37,875 INFO L321 Elim1Store]: treesize reduction 98, result has 64.6 percent of original size [2022-11-20 10:55:37,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 166 treesize of output 288 [2022-11-20 10:55:37,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:55:37,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 10:55:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:55:43,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31498674] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:55:43,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:55:43,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 42 [2022-11-20 10:55:43,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909153356] [2022-11-20 10:55:43,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:55:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:43,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 10:55:43,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1484, Unknown=1, NotChecked=0, Total=1722 [2022-11-20 10:55:43,887 INFO L87 Difference]: Start difference. First operand 558 states and 972 transitions. cyclomatic complexity: 439 Second operand has 42 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 42 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:45,793 INFO L93 Difference]: Finished difference Result 610 states and 1065 transitions. [2022-11-20 10:55:45,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 610 states and 1065 transitions. [2022-11-20 10:55:45,798 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 63 [2022-11-20 10:55:45,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 610 states to 610 states and 1065 transitions. [2022-11-20 10:55:45,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 263 [2022-11-20 10:55:45,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2022-11-20 10:55:45,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 610 states and 1065 transitions. [2022-11-20 10:55:45,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:55:45,803 INFO L218 hiAutomatonCegarLoop]: Abstraction has 610 states and 1065 transitions. [2022-11-20 10:55:45,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states and 1065 transitions. [2022-11-20 10:55:45,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 600. [2022-11-20 10:55:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 600 states have (on average 1.75) internal successors, (1050), 599 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1050 transitions. [2022-11-20 10:55:45,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 600 states and 1050 transitions. [2022-11-20 10:55:45,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 10:55:45,817 INFO L428 stractBuchiCegarLoop]: Abstraction has 600 states and 1050 transitions. [2022-11-20 10:55:45,817 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-11-20 10:55:45,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 600 states and 1050 transitions. [2022-11-20 10:55:45,821 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 63 [2022-11-20 10:55:45,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:45,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:45,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:45,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2022-11-20 10:55:45,822 INFO L748 eck$LassoCheckResult]: Stem: 13017#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13018#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 13038#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 13044#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 13013#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 13014#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 13015#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 13016#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 13076#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 13100#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 13072#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 13082#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 13086#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 13104#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 13062#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 13063#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 13123#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 13136#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 13064#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 13065#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 13133#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 13058#L517-4 lis_~i~0#1 := 1; 13059#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 13604#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 13255#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 13172#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 13169#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 13168#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 13167#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 13166#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 13165#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 13163#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 13164#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 13342#L520-2 [2022-11-20 10:55:45,823 INFO L750 eck$LassoCheckResult]: Loop: 13342#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 13339#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 13335#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 13156#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 13274#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 13403#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 13130#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 13399#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 13398#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 13396#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 13391#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 13342#L520-2 [2022-11-20 10:55:45,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash -217563726, now seen corresponding path program 3 times [2022-11-20 10:55:45,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:45,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672435356] [2022-11-20 10:55:45,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:45,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:46,098 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:55:46,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:46,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672435356] [2022-11-20 10:55:46,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672435356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:46,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132611319] [2022-11-20 10:55:46,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:55:46,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:46,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:46,107 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:46,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-11-20 10:55:46,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 10:55:46,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:55:46,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 10:55:46,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:55:46,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:55:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:55:46,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132611319] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:55:46,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:55:46,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-20 10:55:46,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441016872] [2022-11-20 10:55:46,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:55:46,814 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 10:55:46,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:46,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1817220311, now seen corresponding path program 1 times [2022-11-20 10:55:46,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:46,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494167390] [2022-11-20 10:55:46,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:46,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:46,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:46,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:49,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:49,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 10:55:49,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:55:49,691 INFO L87 Difference]: Start difference. First operand 600 states and 1050 transitions. cyclomatic complexity: 475 Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:50,033 INFO L93 Difference]: Finished difference Result 562 states and 974 transitions. [2022-11-20 10:55:50,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 974 transitions. [2022-11-20 10:55:50,038 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 67 [2022-11-20 10:55:50,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 562 states and 974 transitions. [2022-11-20 10:55:50,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2022-11-20 10:55:50,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2022-11-20 10:55:50,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 974 transitions. [2022-11-20 10:55:50,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:55:50,043 INFO L218 hiAutomatonCegarLoop]: Abstraction has 562 states and 974 transitions. [2022-11-20 10:55:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 974 transitions. [2022-11-20 10:55:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 558. [2022-11-20 10:55:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 558 states have (on average 1.7365591397849462) internal successors, (969), 557 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 969 transitions. [2022-11-20 10:55:50,055 INFO L240 hiAutomatonCegarLoop]: Abstraction has 558 states and 969 transitions. [2022-11-20 10:55:50,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:55:50,056 INFO L428 stractBuchiCegarLoop]: Abstraction has 558 states and 969 transitions. [2022-11-20 10:55:50,056 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-11-20 10:55:50,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 558 states and 969 transitions. [2022-11-20 10:55:50,059 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 63 [2022-11-20 10:55:50,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:50,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:50,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:50,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-11-20 10:55:50,061 INFO L748 eck$LassoCheckResult]: Stem: 14405#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14406#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 14426#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 14440#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 14401#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 14402#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 14420#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 14483#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 14468#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 14520#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 14463#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 14519#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 14511#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 14523#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 14505#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 14515#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 14498#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 14521#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 14493#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 14527#L517-4 lis_~i~0#1 := 1; 14596#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 14597#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 14592#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 14589#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 14580#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 14543#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 14423#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 14424#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 14906#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 14901#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 14416#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 14417#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 14932#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 14929#L521 assume !lis_#t~short11#1; 14916#L521-2 [2022-11-20 10:55:50,061 INFO L750 eck$LassoCheckResult]: Loop: 14916#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 14910#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 14920#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 14918#L521 assume !lis_#t~short11#1; 14916#L521-2 [2022-11-20 10:55:50,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:50,061 INFO L85 PathProgramCache]: Analyzing trace with hash 835003923, now seen corresponding path program 1 times [2022-11-20 10:55:50,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:50,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955338849] [2022-11-20 10:55:50,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:50,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:50,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:50,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:50,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:50,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2895272, now seen corresponding path program 2 times [2022-11-20 10:55:50,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:50,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730943177] [2022-11-20 10:55:50,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:50,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:50,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:50,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:50,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:50,186 INFO L85 PathProgramCache]: Analyzing trace with hash -538182982, now seen corresponding path program 4 times [2022-11-20 10:55:50,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:50,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340065410] [2022-11-20 10:55:50,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:50,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 10:55:50,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:50,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340065410] [2022-11-20 10:55:50,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340065410] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:50,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545874051] [2022-11-20 10:55:50,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:55:50,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:50,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:50,453 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:50,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-11-20 10:55:50,665 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:55:50,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:55:50,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:55:50,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:55:50,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:55:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:55:51,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545874051] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:55:51,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:55:51,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-11-20 10:55:51,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051066892] [2022-11-20 10:55:51,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:55:51,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:51,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 10:55:51,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:55:51,171 INFO L87 Difference]: Start difference. First operand 558 states and 969 transitions. cyclomatic complexity: 436 Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:51,732 INFO L93 Difference]: Finished difference Result 636 states and 1065 transitions. [2022-11-20 10:55:51,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 636 states and 1065 transitions. [2022-11-20 10:55:51,737 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 50 [2022-11-20 10:55:51,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 636 states to 492 states and 855 transitions. [2022-11-20 10:55:51,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2022-11-20 10:55:51,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2022-11-20 10:55:51,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 492 states and 855 transitions. [2022-11-20 10:55:51,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:55:51,741 INFO L218 hiAutomatonCegarLoop]: Abstraction has 492 states and 855 transitions. [2022-11-20 10:55:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states and 855 transitions. [2022-11-20 10:55:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 468. [2022-11-20 10:55:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 468 states have (on average 1.7478632478632479) internal successors, (818), 467 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 818 transitions. [2022-11-20 10:55:51,751 INFO L240 hiAutomatonCegarLoop]: Abstraction has 468 states and 818 transitions. [2022-11-20 10:55:51,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 10:55:51,752 INFO L428 stractBuchiCegarLoop]: Abstraction has 468 states and 818 transitions. [2022-11-20 10:55:51,752 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-11-20 10:55:51,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 468 states and 818 transitions. [2022-11-20 10:55:51,755 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 50 [2022-11-20 10:55:51,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:51,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:51,756 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:51,756 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2022-11-20 10:55:51,756 INFO L748 eck$LassoCheckResult]: Stem: 15866#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15867#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 15885#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 15912#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 15862#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 15863#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 15933#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 15930#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 15928#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 15924#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 15923#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 15917#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 15916#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 15913#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 15908#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15909#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 15955#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15967#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 15951#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15969#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 15910#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15911#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 16066#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 16325#L517-4 lis_~i~0#1 := 1; 16057#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 16312#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 16046#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 16305#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 16303#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 16301#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 16300#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 15891#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 15871#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 15872#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 16308#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 16078#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 16069#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 16138#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 15899#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 16117#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 16128#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 15965#L519-2 [2022-11-20 10:55:51,757 INFO L750 eck$LassoCheckResult]: Loop: 15965#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 16112#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 16111#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 16109#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 16104#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 16129#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 16127#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 16125#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 16121#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 15994#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 16115#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 15965#L519-2 [2022-11-20 10:55:51,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1830415302, now seen corresponding path program 4 times [2022-11-20 10:55:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:51,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875194191] [2022-11-20 10:55:51,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:51,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:51,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:51,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:51,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash -943445823, now seen corresponding path program 9 times [2022-11-20 10:55:51,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:51,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714829083] [2022-11-20 10:55:51,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:51,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:51,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:51,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:51,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash 546793192, now seen corresponding path program 4 times [2022-11-20 10:55:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:51,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427648707] [2022-11-20 10:55:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:51,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 10:55:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:52,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427648707] [2022-11-20 10:55:52,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427648707] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:52,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134042518] [2022-11-20 10:55:52,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:55:52,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:52,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:52,168 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:52,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-11-20 10:55:52,410 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:55:52,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:55:52,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:55:52,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:55:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 10:55:52,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:55:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 10:55:52,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134042518] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:55:52,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:55:52,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-11-20 10:55:52,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900075794] [2022-11-20 10:55:52,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:55:53,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:53,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:55:53,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:55:53,191 INFO L87 Difference]: Start difference. First operand 468 states and 818 transitions. cyclomatic complexity: 367 Second operand has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:53,446 INFO L93 Difference]: Finished difference Result 548 states and 973 transitions. [2022-11-20 10:55:53,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 548 states and 973 transitions. [2022-11-20 10:55:53,450 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 77 [2022-11-20 10:55:53,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 548 states to 548 states and 973 transitions. [2022-11-20 10:55:53,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 233 [2022-11-20 10:55:53,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 233 [2022-11-20 10:55:53,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 548 states and 973 transitions. [2022-11-20 10:55:53,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 10:55:53,454 INFO L218 hiAutomatonCegarLoop]: Abstraction has 548 states and 973 transitions. [2022-11-20 10:55:53,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states and 973 transitions. [2022-11-20 10:55:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 494. [2022-11-20 10:55:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 494 states have (on average 1.7651821862348178) internal successors, (872), 493 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 872 transitions. [2022-11-20 10:55:53,465 INFO L240 hiAutomatonCegarLoop]: Abstraction has 494 states and 872 transitions. [2022-11-20 10:55:53,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:55:53,466 INFO L428 stractBuchiCegarLoop]: Abstraction has 494 states and 872 transitions. [2022-11-20 10:55:53,467 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-11-20 10:55:53,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 494 states and 872 transitions. [2022-11-20 10:55:53,469 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 65 [2022-11-20 10:55:53,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 10:55:53,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 10:55:53,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:53,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2022-11-20 10:55:53,471 INFO L748 eck$LassoCheckResult]: Stem: 17214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 17216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 17234#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 17222#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 17212#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 17213#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 17280#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 17279#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 17276#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 17273#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 17267#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 17264#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 17263#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 17249#L535-4 assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 17250#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 17237#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 17238#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 17303#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 17313#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 17299#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 17311#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 17295#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 17698#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 17524#L517-4 lis_~i~0#1 := 1; 17694#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 17380#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 17691#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 17361#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 17357#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 17354#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 17352#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 17351#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 17350#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 17348#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 17349#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 17479#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 17478#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 17476#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 17344#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 17470#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 17485#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 17326#L519-2 [2022-11-20 10:55:53,471 INFO L750 eck$LassoCheckResult]: Loop: 17326#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 17460#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 17459#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 17457#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 17453#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 17450#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 17498#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 17496#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 17491#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 17435#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 17486#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 17483#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 17481#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 17468#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 17464#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 17326#L519-2 [2022-11-20 10:55:53,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:53,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1830415302, now seen corresponding path program 5 times [2022-11-20 10:55:53,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:53,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766960622] [2022-11-20 10:55:53,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:53,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:53,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:53,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2075755396, now seen corresponding path program 10 times [2022-11-20 10:55:53,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:53,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763154681] [2022-11-20 10:55:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:53,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:53,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:55:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:55:53,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:55:53,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:53,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1485811933, now seen corresponding path program 5 times [2022-11-20 10:55:53,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:53,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118697835] [2022-11-20 10:55:53,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:53,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 32 proven. 83 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:55:58,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:58,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118697835] [2022-11-20 10:55:58,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118697835] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:55:58,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983510000] [2022-11-20 10:55:58,374 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 10:55:58,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:55:58,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:58,378 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:55:58,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66417ffd-8edd-48fa-a5a0-5326cfe2b0aa/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-11-20 10:56:00,434 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-20 10:56:00,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:56:00,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-20 10:56:00,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:56:00,634 INFO L321 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2022-11-20 10:56:00,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 66 [2022-11-20 10:56:00,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2022-11-20 10:56:00,689 INFO L321 Elim1Store]: treesize reduction 42, result has 30.0 percent of original size [2022-11-20 10:56:00,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 82 [2022-11-20 10:56:00,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:56:00,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:56:00,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:56:00,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-20 10:56:00,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2022-11-20 10:56:00,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-11-20 10:56:01,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:01,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:01,101 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-20 10:56:01,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 66 [2022-11-20 10:56:01,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:01,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:01,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:01,442 INFO L321 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2022-11-20 10:56:01,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 112 treesize of output 102 [2022-11-20 10:56:01,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:01,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:01,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:01,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:01,856 INFO L321 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2022-11-20 10:56:01,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 101 treesize of output 104 [2022-11-20 10:56:02,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:02,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:02,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:02,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:02,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:02,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:02,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:02,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:02,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:02,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:02,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:02,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:02,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:02,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:03,003 INFO L321 Elim1Store]: treesize reduction 333, result has 22.6 percent of original size [2022-11-20 10:56:03,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 34 case distinctions, treesize of input 134 treesize of output 169 [2022-11-20 10:56:04,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:04,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:04,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:04,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:04,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:04,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:04,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:04,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:04,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:04,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:04,795 INFO L321 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2022-11-20 10:56:04,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 29 case distinctions, treesize of input 130 treesize of output 131 [2022-11-20 10:56:04,829 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:56:04,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 111 [2022-11-20 10:56:04,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2022-11-20 10:56:05,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:05,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:05,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:05,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:05,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:05,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:05,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:05,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:05,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2022-11-20 10:56:05,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-20 10:56:06,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:06,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:06,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:06,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:56:06,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:56:06,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:56:06,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 24 [2022-11-20 10:56:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 32 proven. 67 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:56:06,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:56:10,768 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_lis_~i~0#1| Int)) (or (forall ((v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2249 Int) (|v_ULTIMATE.start_lis_~j~0#1_282| Int) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2259 Int)) (let ((.cse4 (* |ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse7 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (store .cse9 (+ .cse4 |c_ULTIMATE.start_lis_~best~0#1.offset|) (+ (select .cse9 (+ (* |c_ULTIMATE.start_lis_~j~0#1| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1)))))) (store .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse4) v_ArrVal_2249))))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse2 (+ .cse4 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (let ((.cse5 (store (store .cse7 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 .cse2 (+ 1 .cse0))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2253))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_lis_~best~0#1.base|))) (or (not (< |v_ULTIMATE.start_lis_~j~0#1_282| (+ |ULTIMATE.start_lis_~i~0#1| 1))) (< .cse0 (select .cse1 .cse2)) (let ((.cse3 (select (store (store .cse5 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse6 .cse2 v_ArrVal_2259)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2258) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ .cse4 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse3 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))) (< (select .cse6 (+ (* |v_ULTIMATE.start_lis_~j~0#1_282| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse6 .cse2)) (not (<= 1 |v_ULTIMATE.start_lis_~j~0#1_282|)))))))))) (not (< |c_ULTIMATE.start_lis_~j~0#1| |ULTIMATE.start_lis_~i~0#1|)) (< (+ |c_ULTIMATE.start_lis_~j~0#1| 1) |ULTIMATE.start_lis_~i~0#1|))) is different from false [2022-11-20 10:56:10,845 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2249 Int) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2259 Int) (|v_ULTIMATE.start_lis_~j~0#1_282| Int) (|ULTIMATE.start_lis_~i~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse7 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (store .cse9 (+ .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) (+ (select .cse9 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))))) (store .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse1) v_ArrVal_2249))))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse4 (+ .cse1 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse5 (select .cse6 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (let ((.cse2 (store (store .cse7 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse6 .cse4 (+ .cse5 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2253))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|))) (or (not (< |v_ULTIMATE.start_lis_~j~0#1_282| (+ |ULTIMATE.start_lis_~i~0#1| 1))) (let ((.cse0 (select (store (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse3 .cse4 v_ArrVal_2259)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2258) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ .cse1 8 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))) (< .cse5 (select .cse6 .cse4)) (not (<= 1 |v_ULTIMATE.start_lis_~j~0#1_282|)) (< (select .cse3 (+ (* |v_ULTIMATE.start_lis_~j~0#1_282| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse3 .cse4)) (< 1 |ULTIMATE.start_lis_~i~0#1|))))))))) is different from false [2022-11-20 10:56:11,162 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2246 Int) (v_ArrVal_2249 Int) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2259 Int) (|v_ULTIMATE.start_lis_~j~0#1_282| Int) (|v_ULTIMATE.start_lis_~i~0#1_371| Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_lis_~i~0#1_371|))) (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse12 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse12 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (store .cse11 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse11 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse12) v_ArrVal_2246)))))) (store .cse9 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_lis_~best~0#1.base|))) (store .cse10 (+ .cse4 |c_ULTIMATE.start_lis_~best~0#1.offset|) (+ (select .cse10 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))))) (store .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse4) v_ArrVal_2249))))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse2 (+ .cse4 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (let ((.cse5 (store (store .cse7 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 .cse2 (+ .cse0 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2253))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_lis_~best~0#1.base|))) (or (< 1 |v_ULTIMATE.start_lis_~i~0#1_371|) (< .cse0 (select .cse1 .cse2)) (not (< |v_ULTIMATE.start_lis_~j~0#1_282| (+ |v_ULTIMATE.start_lis_~i~0#1_371| 1))) (not (<= 1 |v_ULTIMATE.start_lis_~j~0#1_282|)) (let ((.cse3 (select (store (store .cse5 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse6 .cse2 v_ArrVal_2259)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2258) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ 8 .cse4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse3 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))) (< (select .cse6 (+ (* |v_ULTIMATE.start_lis_~j~0#1_282| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse6 .cse2)))))))))) is different from false [2022-11-20 10:56:11,286 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2246 Int) (v_ArrVal_2249 Int) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2259 Int) (|v_ULTIMATE.start_lis_~j~0#1_282| Int) (|v_ULTIMATE.start_lis_~i~0#1_371| Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_lis_~i~0#1_371|))) (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse12 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse12 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (store .cse11 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse11 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse12 4) v_ArrVal_2246)))))) (store .cse9 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_lis_~best~0#1.base|))) (store .cse10 (+ .cse5 |c_ULTIMATE.start_lis_~best~0#1.offset|) (+ (select .cse10 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))))) (store .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse5) v_ArrVal_2249))))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse1 (+ .cse5 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse3 .cse1 (+ .cse2 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2253))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_lis_~best~0#1.base|))) (or (< 1 |v_ULTIMATE.start_lis_~i~0#1_371|) (< (select .cse0 (+ (* |v_ULTIMATE.start_lis_~j~0#1_282| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 .cse1)) (< .cse2 (select .cse3 .cse1)) (not (< |v_ULTIMATE.start_lis_~j~0#1_282| (+ |v_ULTIMATE.start_lis_~i~0#1_371| 1))) (not (<= 1 |v_ULTIMATE.start_lis_~j~0#1_282|)) (let ((.cse4 (select (store (store .cse6 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 .cse1 v_ArrVal_2259)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2258) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse4 (+ 8 .cse5 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse4 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))))))))))) is different from false [2022-11-20 10:56:11,729 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2246 Int) (v_ArrVal_2249 Int) (v_ArrVal_2237 Int) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2259 Int) (|v_ULTIMATE.start_lis_~j~0#1_282| Int) (|v_ULTIMATE.start_lis_~i~0#1_371| Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_lis_~i~0#1_371|))) (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse12 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse12 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (store .cse14 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse14 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse12) v_ArrVal_2237))))) (store .cse13 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse13 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse12 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) (store .cse11 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse11 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse12 4) v_ArrVal_2246)))))) (store .cse9 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_lis_~best~0#1.base|))) (store .cse10 (+ .cse5 |c_ULTIMATE.start_lis_~best~0#1.offset|) (+ (select .cse10 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))))) (store .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse5) v_ArrVal_2249))))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse2 (+ .cse5 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 .cse2 (+ .cse0 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2253))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_lis_~best~0#1.base|))) (or (< .cse0 (select .cse1 .cse2)) (not (<= |c_ULTIMATE.start_lis_~i~0#1| v_ArrVal_2237)) (< 1 |v_ULTIMATE.start_lis_~i~0#1_371|) (< (select .cse3 (+ (* |v_ULTIMATE.start_lis_~j~0#1_282| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse3 .cse2)) (let ((.cse4 (select (store (store .cse6 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse3 .cse2 v_ArrVal_2259)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2258) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse4 (+ 8 .cse5 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ 1 (select .cse4 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) (not (< |v_ULTIMATE.start_lis_~j~0#1_282| (+ |v_ULTIMATE.start_lis_~i~0#1_371| 1))) (not (<= 1 |v_ULTIMATE.start_lis_~j~0#1_282|)))))))))) is different from false [2022-11-20 10:56:12,103 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2246 Int) (v_ArrVal_2249 Int) (v_ArrVal_2237 Int) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2259 Int) (|v_ULTIMATE.start_lis_~j~0#1_282| Int) (|v_ULTIMATE.start_lis_~i~0#1_371| Int)) (let ((.cse1 (* 4 |v_ULTIMATE.start_lis_~i~0#1_371|))) (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse12 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse12 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (store .cse14 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse14 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse12 4) v_ArrVal_2237))))) (store .cse13 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse13 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse12 8 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) (store .cse11 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse11 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse12 8) v_ArrVal_2246)))))) (store .cse9 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_lis_~best~0#1.base|))) (store .cse10 (+ .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) (+ (select .cse10 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))))) (store .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse1) v_ArrVal_2249))))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse4 (+ .cse1 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse5 (select .cse6 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (let ((.cse2 (store (store .cse7 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse6 .cse4 (+ .cse5 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2253))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|))) (or (let ((.cse0 (select (store (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse3 .cse4 v_ArrVal_2259)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2258) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ 8 .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse0 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))) (< 1 |v_ULTIMATE.start_lis_~i~0#1_371|) (< (select .cse3 (+ (* |v_ULTIMATE.start_lis_~j~0#1_282| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse3 .cse4)) (not (< |v_ULTIMATE.start_lis_~j~0#1_282| (+ |v_ULTIMATE.start_lis_~i~0#1_371| 1))) (not (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 1) v_ArrVal_2237)) (< .cse5 (select .cse6 .cse4)) (not (<= 1 |v_ULTIMATE.start_lis_~j~0#1_282|)))))))))) is different from false [2022-11-20 10:56:12,841 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2246 Int) (v_ArrVal_2249 Int) (v_ArrVal_2237 Int) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2259 Int) (|v_ULTIMATE.start_lis_~j~0#1_282| Int) (|v_ULTIMATE.start_lis_~i~0#1_371| Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_lis_~i~0#1_371|))) (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse12 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse12 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (store .cse16 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse16 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse12) |c_ULTIMATE.start_lis_~i~0#1|))))) (store .cse15 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse15 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse12 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) (store .cse14 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse14 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse12 4) v_ArrVal_2237))))) (store .cse13 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse13 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse12 8 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) (store .cse11 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse11 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse12 8) v_ArrVal_2246)))))) (store .cse9 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_lis_~best~0#1.base|))) (store .cse10 (+ .cse5 |c_ULTIMATE.start_lis_~best~0#1.offset|) (+ (select .cse10 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))))) (store .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse8 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse5) v_ArrVal_2249))))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse2 (+ .cse5 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 .cse2 (+ .cse0 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2253))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_lis_~best~0#1.base|))) (or (< .cse0 (select .cse1 .cse2)) (< (select .cse3 (+ (* |v_ULTIMATE.start_lis_~j~0#1_282| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse3 .cse2)) (let ((.cse4 (select (store (store .cse6 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse3 .cse2 v_ArrVal_2259)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_2258) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse4 (+ 8 .cse5 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (+ (select .cse4 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))) (< 1 |v_ULTIMATE.start_lis_~i~0#1_371|) (not (< |v_ULTIMATE.start_lis_~j~0#1_282| (+ |v_ULTIMATE.start_lis_~i~0#1_371| 1))) (not (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 1) v_ArrVal_2237)) (not (<= 1 |v_ULTIMATE.start_lis_~j~0#1_282|)))))))))) is different from false [2022-11-20 10:56:24,162 WARN L233 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 28 DAG size of output: 25 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-20 10:56:24,163 INFO L321 Elim1Store]: treesize reduction 17, result has 66.0 percent of original size [2022-11-20 10:56:24,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 559908 treesize of output 360260