./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 08:46:56,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 08:46:56,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 08:46:56,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 08:46:56,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 08:46:56,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 08:46:56,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 08:46:56,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 08:46:56,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 08:46:56,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 08:46:56,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 08:46:56,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 08:46:56,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 08:46:56,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 08:46:56,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 08:46:56,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 08:46:56,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 08:46:56,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 08:46:56,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 08:46:56,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 08:46:56,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 08:46:56,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 08:46:56,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 08:46:56,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 08:46:56,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 08:46:56,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 08:46:56,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 08:46:56,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 08:46:56,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 08:46:56,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 08:46:56,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 08:46:56,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 08:46:56,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 08:46:56,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 08:46:56,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 08:46:56,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 08:46:56,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 08:46:56,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 08:46:56,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 08:46:56,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 08:46:56,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 08:46:56,430 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-28 08:46:56,484 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 08:46:56,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 08:46:56,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 08:46:56,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 08:46:56,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 08:46:56,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 08:46:56,487 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 08:46:56,488 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-28 08:46:56,488 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-28 08:46:56,488 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-28 08:46:56,489 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-28 08:46:56,490 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-28 08:46:56,490 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-28 08:46:56,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 08:46:56,490 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 08:46:56,490 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 08:46:56,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 08:46:56,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 08:46:56,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 08:46:56,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-28 08:46:56,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-28 08:46:56,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-28 08:46:56,492 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 08:46:56,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 08:46:56,492 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-28 08:46:56,492 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 08:46:56,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-28 08:46:56,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 08:46:56,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 08:46:56,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 08:46:56,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 08:46:56,496 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 08:46:56,497 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-28 08:46:56,497 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_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/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_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2021-10-28 08:46:56,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 08:46:56,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 08:46:56,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 08:46:56,806 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 08:46:56,807 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 08:46:56,808 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-10-28 08:46:56,878 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/data/639c7cc18/58b0358d1aeb45ffb0568eddd3a4f596/FLAGe98d415a3 [2021-10-28 08:46:57,393 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 08:46:57,393 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-10-28 08:46:57,407 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/data/639c7cc18/58b0358d1aeb45ffb0568eddd3a4f596/FLAGe98d415a3 [2021-10-28 08:46:57,707 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/data/639c7cc18/58b0358d1aeb45ffb0568eddd3a4f596 [2021-10-28 08:46:57,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 08:46:57,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 08:46:57,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 08:46:57,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 08:46:57,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 08:46:57,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:46:57" (1/1) ... [2021-10-28 08:46:57,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e33df22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:46:57, skipping insertion in model container [2021-10-28 08:46:57,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:46:57" (1/1) ... [2021-10-28 08:46:57,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 08:46:57,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 08:46:58,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:46:58,124 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 08:46:58,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:46:58,193 INFO L208 MainTranslator]: Completed translation [2021-10-28 08:46:58,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:46:58 WrapperNode [2021-10-28 08:46:58,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 08:46:58,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 08:46:58,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 08:46:58,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 08:46:58,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:46:58" (1/1) ... [2021-10-28 08:46:58,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:46:58" (1/1) ... [2021-10-28 08:46:58,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 08:46:58,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 08:46:58,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 08:46:58,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 08:46:58,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:46:58" (1/1) ... [2021-10-28 08:46:58,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:46:58" (1/1) ... [2021-10-28 08:46:58,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:46:58" (1/1) ... [2021-10-28 08:46:58,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:46:58" (1/1) ... [2021-10-28 08:46:58,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:46:58" (1/1) ... [2021-10-28 08:46:58,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:46:58" (1/1) ... [2021-10-28 08:46:58,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:46:58" (1/1) ... [2021-10-28 08:46:58,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 08:46:58,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 08:46:58,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 08:46:58,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 08:46:58,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:46:58" (1/1) ... [2021-10-28 08:46:58,289 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:46:58,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:46:58,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:46:58,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-28 08:46:58,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 08:46:58,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 08:46:58,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 08:46:58,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 08:46:58,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 08:46:58,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 08:46:58,638 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 08:46:58,638 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-10-28 08:46:58,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:46:58 BoogieIcfgContainer [2021-10-28 08:46:58,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 08:46:58,641 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-28 08:46:58,641 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-28 08:46:58,645 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-28 08:46:58,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 08:46:58,646 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.10 08:46:57" (1/3) ... [2021-10-28 08:46:58,647 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76478978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 08:46:58, skipping insertion in model container [2021-10-28 08:46:58,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 08:46:58,647 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:46:58" (2/3) ... [2021-10-28 08:46:58,648 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76478978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 08:46:58, skipping insertion in model container [2021-10-28 08:46:58,648 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 08:46:58,648 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:46:58" (3/3) ... [2021-10-28 08:46:58,650 INFO L389 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2021-10-28 08:46:58,716 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-28 08:46:58,716 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-28 08:46:58,716 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-28 08:46:58,716 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-28 08:46:58,716 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-28 08:46:58,717 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-28 08:46:58,717 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-28 08:46:58,717 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-28 08:46:58,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:46:58,786 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-10-28 08:46:58,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:46:58,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:46:58,793 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-28 08:46:58,793 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-28 08:46:58,793 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-28 08:46:58,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:46:58,797 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-10-28 08:46:58,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:46:58,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:46:58,798 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-28 08:46:58,799 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-28 08:46:58,806 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 11#L530true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7#L530-2true call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 4#L535-3true [2021-10-28 08:46:58,807 INFO L793 eck$LassoCheckResult]: Loop: 4#L535-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 17#L535-2true main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 4#L535-3true [2021-10-28 08:46:58,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:46:58,815 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-10-28 08:46:58,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:46:58,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846693202] [2021-10-28 08:46:58,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:46:58,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:46:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:46:58,945 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:46:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:46:59,000 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:46:59,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:46:59,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-10-28 08:46:59,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:46:59,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056309768] [2021-10-28 08:46:59,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:46:59,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:46:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:46:59,033 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:46:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:46:59,068 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:46:59,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:46:59,080 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-10-28 08:46:59,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:46:59,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931195175] [2021-10-28 08:46:59,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:46:59,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:46:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:46:59,131 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:46:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:46:59,155 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:46:59,621 INFO L210 LassoAnalysis]: Preferences: [2021-10-28 08:46:59,621 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-28 08:46:59,622 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-28 08:46:59,623 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-28 08:46:59,623 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-28 08:46:59,623 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:46:59,623 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-28 08:46:59,623 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-28 08:46:59,624 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2021-10-28 08:46:59,624 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-28 08:46:59,625 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-28 08:46:59,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:46:59,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:46:59,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:46:59,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:46:59,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:46:59,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:46:59,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:46:59,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:46:59,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:46:59,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:00,183 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-28 08:47:00,189 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-28 08:47:00,191 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:00,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:00,194 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:00,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:00,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:00,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 08:47:00,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:00,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:00,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:00,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 08:47:00,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 08:47:00,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-10-28 08:47:00,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:00,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:00,288 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:00,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:00,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:00,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-10-28 08:47:00,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:00,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:00,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 08:47:00,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:00,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:00,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:00,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 08:47:00,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 08:47:00,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:00,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:00,372 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:00,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:00,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:00,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-10-28 08:47:00,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:00,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:00,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:00,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:00,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:00,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 08:47:00,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 08:47:00,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:00,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:00,454 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:00,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:00,457 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:00,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:00,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:00,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 08:47:00,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:00,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:00,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:00,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 08:47:00,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 08:47:00,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-10-28 08:47:00,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:00,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-10-28 08:47:00,540 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:00,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:00,542 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:00,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-10-28 08:47:00,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:00,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:00,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:00,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:00,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:00,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 08:47:00,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 08:47:00,600 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-28 08:47:00,660 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-10-28 08:47:00,660 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-10-28 08:47:00,662 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:00,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:00,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:00,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-10-28 08:47:00,694 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-28 08:47:00,726 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-28 08:47:00,726 INFO L513 LassoAnalysis]: Proved termination. [2021-10-28 08:47:00,727 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2021-10-28 08:47:00,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:00,788 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-10-28 08:47:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:00,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-28 08:47:00,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:47:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:00,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-28 08:47:00,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:47:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:47:00,940 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-10-28 08:47:00,942 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:01,046 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 99 transitions. Complement of second has 7 states. [2021-10-28 08:47:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-10-28 08:47:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2021-10-28 08:47:01,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2021-10-28 08:47:01,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 08:47:01,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2021-10-28 08:47:01,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 08:47:01,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 4 letters. Loop has 4 letters. [2021-10-28 08:47:01,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 08:47:01,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 99 transitions. [2021-10-28 08:47:01,079 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-10-28 08:47:01,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 21 states and 30 transitions. [2021-10-28 08:47:01,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-10-28 08:47:01,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-10-28 08:47:01,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2021-10-28 08:47:01,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:47:01,091 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-10-28 08:47:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2021-10-28 08:47:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-10-28 08:47:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2021-10-28 08:47:01,131 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-10-28 08:47:01,131 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2021-10-28 08:47:01,132 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-28 08:47:01,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2021-10-28 08:47:01,135 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-10-28 08:47:01,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:47:01,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:47:01,136 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-10-28 08:47:01,136 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-28 08:47:01,137 INFO L791 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 152#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 160#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 156#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 147#L535-3 assume !(main_~i~1 < main_~array_size~0); 149#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 162#L517-3 [2021-10-28 08:47:01,138 INFO L793 eck$LassoCheckResult]: Loop: 162#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 161#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 162#L517-3 [2021-10-28 08:47:01,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:01,139 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-10-28 08:47:01,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:01,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130201314] [2021-10-28 08:47:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:01,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:47:01,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:47:01,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130201314] [2021-10-28 08:47:01,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130201314] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:47:01,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:47:01,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:47:01,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718204215] [2021-10-28 08:47:01,280 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 08:47:01,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:01,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2021-10-28 08:47:01,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:01,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131135249] [2021-10-28 08:47:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:01,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:01,292 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:01,303 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:01,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:47:01,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:47:01,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:47:01,471 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:47:01,515 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2021-10-28 08:47:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:47:01,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2021-10-28 08:47:01,519 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-10-28 08:47:01,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2021-10-28 08:47:01,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-10-28 08:47:01,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-10-28 08:47:01,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-10-28 08:47:01,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:47:01,527 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-10-28 08:47:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-10-28 08:47:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-10-28 08:47:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2021-10-28 08:47:01,530 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-10-28 08:47:01,530 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-10-28 08:47:01,530 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-28 08:47:01,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2021-10-28 08:47:01,531 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-10-28 08:47:01,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:47:01,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:47:01,532 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:47:01,532 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-28 08:47:01,533 INFO L791 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 202#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 210#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 206#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 197#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 198#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 199#L535-3 assume !(main_~i~1 < main_~array_size~0); 200#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 212#L517-3 [2021-10-28 08:47:01,533 INFO L793 eck$LassoCheckResult]: Loop: 212#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 211#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 212#L517-3 [2021-10-28 08:47:01,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-10-28 08:47:01,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:01,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655406784] [2021-10-28 08:47:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:01,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:01,557 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:01,586 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:01,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:01,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2021-10-28 08:47:01,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:01,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768625816] [2021-10-28 08:47:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:01,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:01,597 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:01,612 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:01,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:01,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2021-10-28 08:47:01,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:01,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067366431] [2021-10-28 08:47:01,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:01,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:01,671 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:01,758 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:01,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:02,827 INFO L210 LassoAnalysis]: Preferences: [2021-10-28 08:47:02,827 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-28 08:47:02,827 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-28 08:47:02,827 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-28 08:47:02,828 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-28 08:47:02,828 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:02,828 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-28 08:47:02,828 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-28 08:47:02,828 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2021-10-28 08:47:02,828 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-28 08:47:02,828 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-28 08:47:02,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:02,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:02,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:02,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:02,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:02,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:02,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:03,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:04,288 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-28 08:47:04,288 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-28 08:47:04,289 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:04,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:04,295 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:04,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:04,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:04,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 08:47:04,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:04,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:04,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:04,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 08:47:04,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 08:47:04,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-10-28 08:47:04,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:04,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:04,368 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:04,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:04,370 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:04,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:04,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:04,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:04,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:04,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:04,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 08:47:04,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 08:47:04,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-10-28 08:47:04,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:04,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:04,454 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:04,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:04,455 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:04,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:04,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:04,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 08:47:04,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:04,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:04,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:04,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 08:47:04,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 08:47:04,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-10-28 08:47:04,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:04,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:04,539 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:04,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:04,540 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:04,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:04,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:04,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 08:47:04,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:04,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:04,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:04,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 08:47:04,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 08:47:04,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-10-28 08:47:04,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:04,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:04,619 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:04,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:04,622 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:04,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:04,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:04,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:04,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:04,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:04,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-10-28 08:47:04,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 08:47:04,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 08:47:04,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:04,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:04,709 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:04,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:04,710 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:04,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:04,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:04,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 08:47:04,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:04,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:04,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:04,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 08:47:04,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 08:47:04,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-10-28 08:47:04,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:04,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:04,792 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:04,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:04,793 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:04,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:04,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:04,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 08:47:04,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:04,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:04,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:04,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 08:47:04,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 08:47:04,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-10-28 08:47:04,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:04,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:04,865 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:04,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:04,867 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:04,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:04,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:04,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:04,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:04,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:04,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 08:47:04,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 08:47:04,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-10-28 08:47:04,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:04,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:04,972 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:04,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:04,973 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:04,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:04,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:04,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:04,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:04,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:05,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-10-28 08:47:05,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 08:47:05,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 08:47:05,059 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-28 08:47:05,135 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-10-28 08:47:05,135 INFO L444 ModelExtractionUtils]: 28 out of 61 variables were initially zero. Simplification set additionally 30 variables to zero. [2021-10-28 08:47:05,135 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:05,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:05,137 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:05,158 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-28 08:47:05,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-10-28 08:47:05,176 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-28 08:47:05,176 INFO L513 LassoAnalysis]: Proved termination. [2021-10-28 08:47:05,177 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2021-10-28 08:47:05,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:05,316 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2021-10-28 08:47:05,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:05,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-28 08:47:05,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:47:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:05,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-28 08:47:05,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:47:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:47:05,432 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-10-28 08:47:05,432 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:05,453 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 35 transitions. Complement of second has 7 states. [2021-10-28 08:47:05,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-10-28 08:47:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-10-28 08:47:05,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2021-10-28 08:47:05,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 08:47:05,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2021-10-28 08:47:05,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 08:47:05,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2021-10-28 08:47:05,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 08:47:05,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-10-28 08:47:05,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-10-28 08:47:05,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2021-10-28 08:47:05,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-10-28 08:47:05,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-10-28 08:47:05,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2021-10-28 08:47:05,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:47:05,458 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-10-28 08:47:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2021-10-28 08:47:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-10-28 08:47:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-10-28 08:47:05,462 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-10-28 08:47:05,462 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-10-28 08:47:05,462 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-28 08:47:05,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2021-10-28 08:47:05,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-10-28 08:47:05,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:47:05,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:47:05,463 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:47:05,463 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-28 08:47:05,464 INFO L791 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 385#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 393#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 389#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 380#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 381#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 382#L535-3 assume !(main_~i~1 < main_~array_size~0); 383#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 400#L517-3 assume !(lis_~i~0 < lis_~N); 401#L517-4 lis_~i~0 := 1; 392#L519-3 [2021-10-28 08:47:05,464 INFO L793 eck$LassoCheckResult]: Loop: 392#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 386#L520-3 assume !(lis_~j~0 < lis_~i~0); 387#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 392#L519-3 [2021-10-28 08:47:05,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2021-10-28 08:47:05,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:05,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118618902] [2021-10-28 08:47:05,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:05,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 08:47:05,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:47:05,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118618902] [2021-10-28 08:47:05,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118618902] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:47:05,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:47:05,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:47:05,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804476521] [2021-10-28 08:47:05,523 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 08:47:05,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:05,523 INFO L85 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2021-10-28 08:47:05,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:05,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715044655] [2021-10-28 08:47:05,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:05,524 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:05,528 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:05,532 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:05,559 INFO L210 LassoAnalysis]: Preferences: [2021-10-28 08:47:05,560 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-28 08:47:05,560 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-28 08:47:05,560 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-28 08:47:05,560 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-10-28 08:47:05,560 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:05,560 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-28 08:47:05,560 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-28 08:47:05,560 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-10-28 08:47:05,560 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-28 08:47:05,561 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-28 08:47:05,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:05,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:05,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:05,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:05,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:05,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:05,693 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-28 08:47:05,694 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-10-28 08:47:05,696 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:05,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:05,697 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:05,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-28 08:47:05,707 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-28 08:47:05,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-10-28 08:47:05,743 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-10-28 08:47:05,743 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_3=1} Honda state: {v_rep~unnamed0~0~P_PID_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-10-28 08:47:05,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:05,835 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:05,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:05,843 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:05,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-10-28 08:47:05,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-28 08:47:05,848 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-28 08:47:05,874 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-10-28 08:47:05,874 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_3=2} Honda state: {v_rep~unnamed0~0~P_PGID_3=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-10-28 08:47:05,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:05,908 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:05,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:05,909 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:05,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-28 08:47:05,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-28 08:47:05,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-10-28 08:47:05,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:05,950 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:05,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:05,951 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:05,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-10-28 08:47:05,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-10-28 08:47:05,953 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-28 08:47:06,143 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-10-28 08:47:06,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2021-10-28 08:47:06,147 INFO L210 LassoAnalysis]: Preferences: [2021-10-28 08:47:06,147 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-28 08:47:06,147 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-28 08:47:06,147 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-28 08:47:06,147 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-28 08:47:06,147 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:06,147 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-28 08:47:06,148 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-28 08:47:06,148 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-10-28 08:47:06,148 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-28 08:47:06,148 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-28 08:47:06,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:06,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:06,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:06,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:06,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:06,246 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-28 08:47:06,246 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-28 08:47:06,247 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:06,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:06,256 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:06,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:06,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:06,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:06,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:06,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:06,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 08:47:06,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 08:47:06,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-10-28 08:47:06,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:06,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:06,355 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:06,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:06,356 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:06,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 [2021-10-28 08:47:06,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:06,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:06,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:06,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:06,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-10-28 08:47:06,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 08:47:06,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 08:47:06,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:47:06,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:06,420 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:06,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:06,421 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:06,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-10-28 08:47:06,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:47:06,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:47:06,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 08:47:06,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:47:06,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:47:06,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:47:06,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 08:47:06,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 08:47:06,443 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-28 08:47:06,448 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-10-28 08:47:06,448 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-10-28 08:47:06,448 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:06,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:06,458 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:47:06,462 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-28 08:47:06,462 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-10-28 08:47:06,462 INFO L513 LassoAnalysis]: Proved termination. [2021-10-28 08:47:06,462 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2021-10-28 08:47:06,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-10-28 08:47:06,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-10-28 08:47:06,490 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-10-28 08:47:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:06,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-28 08:47:06,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:47:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:06,564 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-28 08:47:06,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:47:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:47:06,606 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-10-28 08:47:06,606 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:06,666 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 67 transitions. Complement of second has 9 states. [2021-10-28 08:47:06,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-10-28 08:47:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-10-28 08:47:06,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2021-10-28 08:47:06,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 08:47:06,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2021-10-28 08:47:06,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 08:47:06,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2021-10-28 08:47:06,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 08:47:06,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2021-10-28 08:47:06,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2021-10-28 08:47:06,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2021-10-28 08:47:06,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-10-28 08:47:06,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-10-28 08:47:06,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2021-10-28 08:47:06,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 08:47:06,672 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 62 transitions. [2021-10-28 08:47:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2021-10-28 08:47:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2021-10-28 08:47:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2021-10-28 08:47:06,676 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2021-10-28 08:47:06,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:47:06,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:47:06,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:47:06,677 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:47:06,731 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2021-10-28 08:47:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:47:06,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2021-10-28 08:47:06,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:47:06,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2021-10-28 08:47:06,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-10-28 08:47:06,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-10-28 08:47:06,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2021-10-28 08:47:06,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 08:47:06,735 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2021-10-28 08:47:06,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2021-10-28 08:47:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-10-28 08:47:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2021-10-28 08:47:06,739 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-10-28 08:47:06,739 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-10-28 08:47:06,739 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-28 08:47:06,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2021-10-28 08:47:06,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:47:06,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:47:06,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:47:06,741 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:47:06,742 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:47:06,742 INFO L791 eck$LassoCheckResult]: Stem: 586#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 587#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 601#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 593#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 582#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 583#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 584#L535-3 assume !(main_~i~1 < main_~array_size~0); 585#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 610#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 602#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 603#L517-3 assume !(lis_~i~0 < lis_~N); 611#L517-4 lis_~i~0 := 1; 612#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 588#L520-3 [2021-10-28 08:47:06,742 INFO L793 eck$LassoCheckResult]: Loop: 588#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 589#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 594#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 595#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 606#L520-3 assume !(lis_~j~0 < lis_~i~0); 598#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 599#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 588#L520-3 [2021-10-28 08:47:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2021-10-28 08:47:06,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:06,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134167571] [2021-10-28 08:47:06,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:06,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 08:47:06,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:47:06,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134167571] [2021-10-28 08:47:06,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134167571] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:47:06,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633570741] [2021-10-28 08:47:06,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:06,804 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:47:06,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:06,818 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:47:06,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-10-28 08:47:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:06,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-28 08:47:06,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:47:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 08:47:07,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633570741] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:47:07,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 08:47:07,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2021-10-28 08:47:07,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669215694] [2021-10-28 08:47:07,037 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 08:47:07,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:07,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2021-10-28 08:47:07,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:07,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438962932] [2021-10-28 08:47:07,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:07,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:07,050 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:07,062 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:07,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:47:07,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 08:47:07,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-28 08:47:07,332 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 21 Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:47:07,632 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2021-10-28 08:47:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 08:47:07,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 109 transitions. [2021-10-28 08:47:07,638 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-10-28 08:47:07,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 58 states and 81 transitions. [2021-10-28 08:47:07,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-10-28 08:47:07,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-10-28 08:47:07,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 81 transitions. [2021-10-28 08:47:07,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 08:47:07,640 INFO L681 BuchiCegarLoop]: Abstraction has 58 states and 81 transitions. [2021-10-28 08:47:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 81 transitions. [2021-10-28 08:47:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2021-10-28 08:47:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2021-10-28 08:47:07,652 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2021-10-28 08:47:07,652 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2021-10-28 08:47:07,652 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-28 08:47:07,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2021-10-28 08:47:07,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:47:07,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:47:07,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:47:07,654 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:47:07,655 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:47:07,655 INFO L791 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 762#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 776#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 768#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 757#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 758#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 759#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 760#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 791#L535-3 assume !(main_~i~1 < main_~array_size~0); 785#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 786#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 789#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 790#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 777#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 778#L517-3 assume !(lis_~i~0 < lis_~N); 787#L517-4 lis_~i~0 := 1; 779#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 763#L520-3 [2021-10-28 08:47:07,655 INFO L793 eck$LassoCheckResult]: Loop: 763#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 764#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 769#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 770#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 781#L520-3 assume !(lis_~j~0 < lis_~i~0); 773#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 774#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 763#L520-3 [2021-10-28 08:47:07,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:07,656 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 2 times [2021-10-28 08:47:07,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:07,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220276958] [2021-10-28 08:47:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:07,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:07,683 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:07,729 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:07,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2021-10-28 08:47:07,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:07,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46445378] [2021-10-28 08:47:07,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:07,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:07,757 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:07,774 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2021-10-28 08:47:07,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:07,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237639613] [2021-10-28 08:47:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:07,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:07,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-28 08:47:07,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:47:07,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237639613] [2021-10-28 08:47:07,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237639613] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:47:07,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551007420] [2021-10-28 08:47:07,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:07,993 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:47:07,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:08,002 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:47:08,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-10-28 08:47:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:08,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-28 08:47:08,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:47:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-28 08:47:08,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551007420] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:47:08,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 08:47:08,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-10-28 08:47:08,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256813810] [2021-10-28 08:47:08,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:47:08,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 08:47:08,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-28 08:47:08,517 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 19 Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:47:08,733 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2021-10-28 08:47:08,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 08:47:08,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 92 transitions. [2021-10-28 08:47:08,735 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2021-10-28 08:47:08,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 83 transitions. [2021-10-28 08:47:08,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-10-28 08:47:08,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-10-28 08:47:08,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 83 transitions. [2021-10-28 08:47:08,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 08:47:08,737 INFO L681 BuchiCegarLoop]: Abstraction has 62 states and 83 transitions. [2021-10-28 08:47:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 83 transitions. [2021-10-28 08:47:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2021-10-28 08:47:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 54 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2021-10-28 08:47:08,744 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-10-28 08:47:08,744 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-10-28 08:47:08,744 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-28 08:47:08,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2021-10-28 08:47:08,745 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-10-28 08:47:08,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:47:08,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:47:08,747 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:47:08,747 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-28 08:47:08,747 INFO L791 eck$LassoCheckResult]: Stem: 962#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 963#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 977#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 969#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 958#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 959#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 960#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 961#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1006#L535-3 assume !(main_~i~1 < main_~array_size~0); 988#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 989#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 978#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 979#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 992#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 996#L517-3 assume !(lis_~i~0 < lis_~N); 990#L517-4 lis_~i~0 := 1; 991#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1000#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 984#L521 [2021-10-28 08:47:08,747 INFO L793 eck$LassoCheckResult]: Loop: 984#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 970#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 971#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 983#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 984#L521 [2021-10-28 08:47:08,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:08,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1159051365, now seen corresponding path program 1 times [2021-10-28 08:47:08,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:08,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178169258] [2021-10-28 08:47:08,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:08,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:08,785 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:08,822 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2655420, now seen corresponding path program 1 times [2021-10-28 08:47:08,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:08,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502796544] [2021-10-28 08:47:08,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:08,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:08,832 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:08,839 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:08,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:08,840 INFO L85 PathProgramCache]: Analyzing trace with hash -651990240, now seen corresponding path program 1 times [2021-10-28 08:47:08,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:08,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308089446] [2021-10-28 08:47:08,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:08,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 08:47:08,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:47:08,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308089446] [2021-10-28 08:47:08,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308089446] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:47:08,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075216470] [2021-10-28 08:47:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:08,929 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:47:08,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:08,935 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:47:08,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-10-28 08:47:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:09,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-28 08:47:09,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:47:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 08:47:09,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075216470] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:47:09,144 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-28 08:47:09,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-10-28 08:47:09,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74272784] [2021-10-28 08:47:09,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:47:09,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 08:47:09,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-28 08:47:09,410 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. cyclomatic complexity: 27 Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:47:09,488 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2021-10-28 08:47:09,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 08:47:09,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2021-10-28 08:47:09,490 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:47:09,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2021-10-28 08:47:09,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-10-28 08:47:09,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-10-28 08:47:09,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2021-10-28 08:47:09,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 08:47:09,492 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 97 transitions. [2021-10-28 08:47:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2021-10-28 08:47:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2021-10-28 08:47:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.375) internal successors, (88), 63 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2021-10-28 08:47:09,500 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2021-10-28 08:47:09,500 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 88 transitions. [2021-10-28 08:47:09,500 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-28 08:47:09,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 88 transitions. [2021-10-28 08:47:09,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:47:09,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:47:09,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:47:09,502 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:47:09,502 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-28 08:47:09,503 INFO L791 eck$LassoCheckResult]: Stem: 1165#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1166#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1178#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1171#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1161#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1162#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1163#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1164#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1214#L535-3 assume !(main_~i~1 < main_~array_size~0); 1213#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1198#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1179#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1180#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1199#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1218#L517-3 assume !(lis_~i~0 < lis_~N); 1196#L517-4 lis_~i~0 := 1; 1184#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1185#L520-3 assume !(lis_~j~0 < lis_~i~0); 1221#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1200#L519-3 assume !(lis_~i~0 < lis_~N); 1197#L519-4 lis_~i~0 := 0; 1191#L523-3 [2021-10-28 08:47:09,503 INFO L793 eck$LassoCheckResult]: Loop: 1191#L523-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 1192#L524 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 1193#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1191#L523-3 [2021-10-28 08:47:09,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:09,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2057131266, now seen corresponding path program 1 times [2021-10-28 08:47:09,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:09,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601484944] [2021-10-28 08:47:09,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:09,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-28 08:47:09,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:47:09,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601484944] [2021-10-28 08:47:09,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601484944] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:47:09,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:47:09,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:47:09,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070681022] [2021-10-28 08:47:09,581 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 08:47:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2021-10-28 08:47:09,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:09,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443321648] [2021-10-28 08:47:09,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:09,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:09,590 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:09,601 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:09,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:47:09,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:47:09,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:47:09,656 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. cyclomatic complexity: 30 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:47:09,702 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2021-10-28 08:47:09,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:47:09,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2021-10-28 08:47:09,704 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:47:09,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 88 transitions. [2021-10-28 08:47:09,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-10-28 08:47:09,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2021-10-28 08:47:09,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 88 transitions. [2021-10-28 08:47:09,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 08:47:09,710 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 88 transitions. [2021-10-28 08:47:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 88 transitions. [2021-10-28 08:47:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2021-10-28 08:47:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.34375) internal successors, (86), 63 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2021-10-28 08:47:09,730 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2021-10-28 08:47:09,730 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2021-10-28 08:47:09,731 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-28 08:47:09,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 86 transitions. [2021-10-28 08:47:09,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:47:09,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:47:09,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:47:09,734 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:47:09,734 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:47:09,735 INFO L791 eck$LassoCheckResult]: Stem: 1303#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1304#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1317#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1309#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1299#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1300#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1301#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1302#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1349#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1350#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1351#L535-3 assume !(main_~i~1 < main_~array_size~0); 1348#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1347#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1346#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1345#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1343#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1342#L517-3 assume !(lis_~i~0 < lis_~N); 1341#L517-4 lis_~i~0 := 1; 1339#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1340#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1326#L521 assume !lis_#t~short11; 1310#L521-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1311#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1305#L520-3 assume !(lis_~j~0 < lis_~i~0); 1306#L519-2 [2021-10-28 08:47:09,735 INFO L793 eck$LassoCheckResult]: Loop: 1306#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1314#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1336#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1355#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1357#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1356#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1354#L520-3 assume !(lis_~j~0 < lis_~i~0); 1306#L519-2 [2021-10-28 08:47:09,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1034472260, now seen corresponding path program 1 times [2021-10-28 08:47:09,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:09,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682248902] [2021-10-28 08:47:09,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:09,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-28 08:47:09,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:47:09,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682248902] [2021-10-28 08:47:09,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682248902] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:47:09,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:47:09,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:47:09,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593395746] [2021-10-28 08:47:09,810 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 08:47:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 3 times [2021-10-28 08:47:09,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:09,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130635969] [2021-10-28 08:47:09,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:09,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:09,829 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:09,841 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:10,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:47:10,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:47:10,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:47:10,079 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:47:10,093 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2021-10-28 08:47:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:47:10,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2021-10-28 08:47:10,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-10-28 08:47:10,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2021-10-28 08:47:10,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-10-28 08:47:10,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-10-28 08:47:10,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2021-10-28 08:47:10,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 08:47:10,096 INFO L681 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-10-28 08:47:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2021-10-28 08:47:10,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-10-28 08:47:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.318840579710145) internal successors, (91), 68 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2021-10-28 08:47:10,100 INFO L704 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-10-28 08:47:10,101 INFO L587 BuchiCegarLoop]: Abstraction has 69 states and 91 transitions. [2021-10-28 08:47:10,101 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-28 08:47:10,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 91 transitions. [2021-10-28 08:47:10,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-10-28 08:47:10,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:47:10,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:47:10,103 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:47:10,103 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:47:10,104 INFO L791 eck$LassoCheckResult]: Stem: 1443#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1444#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1458#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1449#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1438#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1439#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1497#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1496#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1495#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1441#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1440#L535-3 assume !(main_~i~1 < main_~array_size~0); 1442#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1475#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1479#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1480#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1459#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1460#L517-3 assume !(lis_~i~0 < lis_~N); 1476#L517-4 lis_~i~0 := 1; 1477#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1445#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1446#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1506#L521-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1461#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1462#L520-3 assume !(lis_~j~0 < lis_~i~0); 1454#L519-2 [2021-10-28 08:47:10,104 INFO L793 eck$LassoCheckResult]: Loop: 1454#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1455#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1481#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1499#L521 assume !lis_#t~short11; 1501#L521-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11; 1500#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1498#L520-3 assume !(lis_~j~0 < lis_~i~0); 1454#L519-2 [2021-10-28 08:47:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2021-10-28 08:47:10,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:10,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098254257] [2021-10-28 08:47:10,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:10,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 08:47:10,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:47:10,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098254257] [2021-10-28 08:47:10,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098254257] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:47:10,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446826123] [2021-10-28 08:47:10,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:10,264 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:47:10,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:47:10,270 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:47:10,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-10-28 08:47:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:47:10,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-28 08:47:10,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:47:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-28 08:47:10,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446826123] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:47:10,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 08:47:10,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-10-28 08:47:10,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653932204] [2021-10-28 08:47:10,620 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 08:47:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash 782608452, now seen corresponding path program 1 times [2021-10-28 08:47:10,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:10,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089157788] [2021-10-28 08:47:10,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:10,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:10,627 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:10,632 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:10,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:47:10,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-28 08:47:10,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-10-28 08:47:10,773 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. cyclomatic complexity: 28 Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:47:11,109 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2021-10-28 08:47:11,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 08:47:11,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 99 transitions. [2021-10-28 08:47:11,111 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-10-28 08:47:11,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 99 transitions. [2021-10-28 08:47:11,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2021-10-28 08:47:11,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2021-10-28 08:47:11,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 99 transitions. [2021-10-28 08:47:11,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-28 08:47:11,113 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 99 transitions. [2021-10-28 08:47:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 99 transitions. [2021-10-28 08:47:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2021-10-28 08:47:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:47:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2021-10-28 08:47:11,146 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-28 08:47:11,146 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2021-10-28 08:47:11,146 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-28 08:47:11,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2021-10-28 08:47:11,147 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-10-28 08:47:11,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:47:11,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:47:11,148 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:47:11,148 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-28 08:47:11,148 INFO L791 eck$LassoCheckResult]: Stem: 1687#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1688#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~nondet19, main_#t~post18, main_~i~1, main_#t~ret20, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1702#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1693#L530-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;main_~i~1 := 0; 1683#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1684#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1685#L535-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet19, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet19; 1686#L535-2 main_#t~post18 := main_~i~1;main_~i~1 := 1 + main_#t~post18;havoc main_#t~post18; 1725#L535-3 assume !(main_~i~1 < main_~array_size~0); 1727#L535-4 lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.allocOnStack(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1741#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1740#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1739#L517-3 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1737#L517-2 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1736#L517-3 assume !(lis_~i~0 < lis_~N); 1719#L517-4 lis_~i~0 := 1; 1705#L519-3 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1706#L520-3 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1749#L521 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1747#L521-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem8;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1746#L520-2 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1723#L520-3 assume !(lis_~j~0 < lis_~i~0); 1724#L519-2 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1743#L519-3 assume !(lis_~i~0 < lis_~N); 1720#L519-4 lis_~i~0 := 0; 1711#L523-3 [2021-10-28 08:47:11,148 INFO L793 eck$LassoCheckResult]: Loop: 1711#L523-3 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 1712#L524 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 1716#L523-2 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 1711#L523-3 [2021-10-28 08:47:11,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:11,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1656376535, now seen corresponding path program 1 times [2021-10-28 08:47:11,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:11,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322804636] [2021-10-28 08:47:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:11,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:11,180 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:11,210 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:11,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 2 times [2021-10-28 08:47:11,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:11,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854610082] [2021-10-28 08:47:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:11,212 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:11,217 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:11,221 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:11,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:47:11,222 INFO L85 PathProgramCache]: Analyzing trace with hash -234008915, now seen corresponding path program 1 times [2021-10-28 08:47:11,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:47:11,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719143862] [2021-10-28 08:47:11,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:47:11,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:47:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:11,257 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:47:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:47:11,294 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:47:16,469 WARN L207 SmtUtils]: Spent 5.11 s on a formula simplification. DAG size of input: 276 DAG size of output: 198 [2021-10-28 08:47:18,336 INFO L210 LassoAnalysis]: Preferences: [2021-10-28 08:47:18,337 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-28 08:47:18,337 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-28 08:47:18,337 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-28 08:47:18,337 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-28 08:47:18,337 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:47:18,337 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-28 08:47:18,337 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-28 08:47:18,337 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration11_Lasso [2021-10-28 08:47:18,337 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-28 08:47:18,337 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-28 08:47:18,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:18,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:47:19,235 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-28 08:47:19,238 INFO L168 Benchmark]: Toolchain (without parser) took 21527.21 ms. Allocated memory was 111.1 MB in the beginning and 180.4 MB in the end (delta: 69.2 MB). Free memory was 72.1 MB in the beginning and 77.9 MB in the end (delta: -5.8 MB). Peak memory consumption was 99.3 MB. Max. memory is 16.1 GB. [2021-10-28 08:47:19,239 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 111.1 MB. Free memory is still 89.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 08:47:19,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.81 ms. Allocated memory is still 111.1 MB. Free memory was 71.9 MB in the beginning and 77.8 MB in the end (delta: -5.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 08:47:19,240 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.72 ms. Allocated memory is still 111.1 MB. Free memory was 77.8 MB in the beginning and 75.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 08:47:19,240 INFO L168 Benchmark]: Boogie Preprocessor took 30.00 ms. Allocated memory is still 111.1 MB. Free memory was 75.8 MB in the beginning and 74.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 08:47:19,240 INFO L168 Benchmark]: RCFGBuilder took 363.09 ms. Allocated memory is still 111.1 MB. Free memory was 74.5 MB in the beginning and 62.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 08:47:19,241 INFO L168 Benchmark]: BuchiAutomizer took 20596.35 ms. Allocated memory was 111.1 MB in the beginning and 180.4 MB in the end (delta: 69.2 MB). Free memory was 62.0 MB in the beginning and 77.9 MB in the end (delta: -16.0 MB). Peak memory consumption was 91.4 MB. Max. memory is 16.1 GB. [2021-10-28 08:47:19,243 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 111.1 MB. Free memory is still 89.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 481.81 ms. Allocated memory is still 111.1 MB. Free memory was 71.9 MB in the beginning and 77.8 MB in the end (delta: -5.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.72 ms. Allocated memory is still 111.1 MB. Free memory was 77.8 MB in the beginning and 75.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.00 ms. Allocated memory is still 111.1 MB. Free memory was 75.8 MB in the beginning and 74.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 363.09 ms. Allocated memory is still 111.1 MB. Free memory was 74.5 MB in the beginning and 62.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 20596.35 ms. Allocated memory was 111.1 MB in the beginning and 180.4 MB in the end (delta: 69.2 MB). Free memory was 62.0 MB in the beginning and 77.9 MB in the end (delta: -16.0 MB). Peak memory consumption was 91.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-28 08:47:19,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-10-28 08:47:19,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-10-28 08:47:19,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2021-10-28 08:47:19,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-10-28 08:47:20,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f9a686-e697-4ea1-a8d7-2e5103a8ad24/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...