./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/array03-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array03-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC --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 7541988e6da98f0cff4ac2bb6ea7091660417951 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/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.0-7b2dab5 [2021-10-11 00:33:45,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:33:45,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:33:45,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:33:45,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:33:45,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:33:45,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:33:45,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:33:45,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:33:45,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:33:45,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:33:45,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:33:45,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:33:45,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:33:45,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:33:45,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:33:45,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:33:45,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:33:45,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:33:45,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:33:45,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:33:45,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:33:45,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:33:45,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:33:45,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:33:45,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:33:45,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:33:45,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:33:45,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:33:45,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:33:45,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:33:45,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:33:45,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:33:45,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:33:45,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:33:45,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:33:45,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:33:45,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:33:45,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:33:45,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:33:45,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:33:45,428 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-11 00:33:45,466 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:33:45,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:33:45,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:33:45,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:33:45,475 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:33:45,475 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-11 00:33:45,475 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-11 00:33:45,475 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-11 00:33:45,476 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-11 00:33:45,476 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-11 00:33:45,477 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-11 00:33:45,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:33:45,477 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:33:45,478 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-11 00:33:45,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:33:45,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:33:45,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:33:45,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-11 00:33:45,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-11 00:33:45,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-11 00:33:45,479 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:33:45,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:33:45,479 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-11 00:33:45,480 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:33:45,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-11 00:33:45,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:33:45,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:33:45,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:33:45,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:33:45,481 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:33:45,482 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-11 00:33:45,482 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_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/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_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC 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 -> 7541988e6da98f0cff4ac2bb6ea7091660417951 [2021-10-11 00:33:45,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:33:45,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:33:45,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:33:45,751 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:33:45,756 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:33:45,758 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/array-memsafety/array03-alloca-2.i [2021-10-11 00:33:45,828 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/data/d1c45861d/121261961cec42e3836454f2ba93de44/FLAGd4f4dfdef [2021-10-11 00:33:46,397 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:33:46,400 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/sv-benchmarks/c/array-memsafety/array03-alloca-2.i [2021-10-11 00:33:46,424 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/data/d1c45861d/121261961cec42e3836454f2ba93de44/FLAGd4f4dfdef [2021-10-11 00:33:46,678 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/data/d1c45861d/121261961cec42e3836454f2ba93de44 [2021-10-11 00:33:46,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:33:46,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:33:46,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:33:46,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:33:46,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:33:46,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:33:46" (1/1) ... [2021-10-11 00:33:46,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65feb0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:46, skipping insertion in model container [2021-10-11 00:33:46,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:33:46" (1/1) ... [2021-10-11 00:33:46,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:33:46,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:33:47,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:33:47,166 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:33:47,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:33:47,277 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:33:47,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:47 WrapperNode [2021-10-11 00:33:47,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:33:47,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:33:47,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:33:47,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:33:47,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:47" (1/1) ... [2021-10-11 00:33:47,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:47" (1/1) ... [2021-10-11 00:33:47,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:33:47,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:33:47,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:33:47,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:33:47,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:47" (1/1) ... [2021-10-11 00:33:47,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:47" (1/1) ... [2021-10-11 00:33:47,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:47" (1/1) ... [2021-10-11 00:33:47,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:47" (1/1) ... [2021-10-11 00:33:47,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:47" (1/1) ... [2021-10-11 00:33:47,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:47" (1/1) ... [2021-10-11 00:33:47,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:47" (1/1) ... [2021-10-11 00:33:47,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:33:47,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:33:47,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:33:47,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:33:47,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:47" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-11 00:33:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 00:33:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:33:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 00:33:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:33:47,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:33:47,797 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:33:47,797 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-10-11 00:33:47,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:47 BoogieIcfgContainer [2021-10-11 00:33:47,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:33:47,807 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-11 00:33:47,808 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-11 00:33:47,823 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-11 00:33:47,824 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:33:47,824 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 11.10 12:33:46" (1/3) ... [2021-10-11 00:33:47,825 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cdc83e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:33:47, skipping insertion in model container [2021-10-11 00:33:47,826 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:33:47,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:47" (2/3) ... [2021-10-11 00:33:47,826 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cdc83e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:33:47, skipping insertion in model container [2021-10-11 00:33:47,826 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:33:47,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:47" (3/3) ... [2021-10-11 00:33:47,828 INFO L389 chiAutomizerObserver]: Analyzing ICFG array03-alloca-2.i [2021-10-11 00:33:47,890 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-11 00:33:47,890 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-11 00:33:47,891 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-11 00:33:47,891 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:33:47,891 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:33:47,891 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-11 00:33:47,891 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:33:47,892 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-11 00:33:47,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2021-10-11 00:33:47,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-10-11 00:33:47,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:47,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:47,930 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-11 00:33:47,930 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-11 00:33:47,930 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-11 00:33:47,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2021-10-11 00:33:47,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-10-11 00:33:47,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:47,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:47,933 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-11 00:33:47,933 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-11 00:33:47,940 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 11#L532true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 16#L532-2true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 6#L537-3true [2021-10-11 00:33:47,941 INFO L796 eck$LassoCheckResult]: Loop: 6#L537-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 4#L537-2true main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 6#L537-3true [2021-10-11 00:33:47,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:47,947 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-10-11 00:33:47,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:47,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792021371] [2021-10-11 00:33:47,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:48,064 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:48,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:48,111 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:48,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:48,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-10-11 00:33:48,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:48,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579049381] [2021-10-11 00:33:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:48,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:48,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:48,162 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-10-11 00:33:48,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:48,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563333418] [2021-10-11 00:33:48,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:48,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:48,224 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:48,234 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:48,479 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:33:48,479 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:33:48,480 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:33:48,480 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:33:48,480 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-11 00:33:48,480 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:48,480 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:33:48,480 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:33:48,481 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration1_Lasso [2021-10-11 00:33:48,481 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:33:48,481 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:33:48,501 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-11 00:33:48,507 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-11 00:33:48,631 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-11 00:33:48,634 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-11 00:33:48,637 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-11 00:33:48,640 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-11 00:33:48,643 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-11 00:33:48,646 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-11 00:33:48,649 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-11 00:33:48,886 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:33:48,890 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:33:48,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:48,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:48,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:33:48,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:48,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:48,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:48,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:33:48,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:48,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:33:48,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:48,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:48,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:33:48,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:48,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:48,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:48,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:33:48,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:48,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:33:49,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:49,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:49,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:49,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:49,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:49,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:33:49,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:33:49,069 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-11 00:33:49,132 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-10-11 00:33:49,132 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:49,145 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-11 00:33:49,168 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-10-11 00:33:49,168 INFO L510 LassoAnalysis]: Proved termination. [2021-10-11 00:33:49,169 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2021-10-11 00:33:49,224 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2021-10-11 00:33:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:49,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 00:33:49,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:49,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-11 00:33:49,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:49,356 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-11 00:33:49,373 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-11 00:33:49,375 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2021-10-11 00:33:49,485 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 44 states and 65 transitions. Complement of second has 7 states. [2021-10-11 00:33:49,486 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-11 00:33:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-11 00:33:49,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2021-10-11 00:33:49,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2021-10-11 00:33:49,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:33:49,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 2 letters. [2021-10-11 00:33:49,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:33:49,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 4 letters. Loop has 4 letters. [2021-10-11 00:33:49,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:33:49,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2021-10-11 00:33:49,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-10-11 00:33:49,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 15 states and 21 transitions. [2021-10-11 00:33:49,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-10-11 00:33:49,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-10-11 00:33:49,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2021-10-11 00:33:49,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:49,509 INFO L692 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2021-10-11 00:33:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2021-10-11 00:33:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-10-11 00:33:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-11 00:33:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2021-10-11 00:33:49,537 INFO L715 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2021-10-11 00:33:49,537 INFO L595 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2021-10-11 00:33:49,537 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-11 00:33:49,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2021-10-11 00:33:49,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-10-11 00:33:49,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:49,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:49,539 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-10-11 00:33:49,539 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-10-11 00:33:49,539 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 138#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 139#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 140#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 133#L537-3 assume !(main_~k~0 < main_~array_size~0); 134#L537-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 129#L516-3 [2021-10-11 00:33:49,540 INFO L796 eck$LassoCheckResult]: Loop: 129#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 132#L518 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 137#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 135#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 136#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 128#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 129#L516-3 [2021-10-11 00:33:49,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:49,540 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-10-11 00:33:49,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:49,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741115202] [2021-10-11 00:33:49,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:49,640 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-11 00:33:49,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741115202] [2021-10-11 00:33:49,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:49,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:49,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143906771] [2021-10-11 00:33:49,644 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:33:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:49,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1807826313, now seen corresponding path program 1 times [2021-10-11 00:33:49,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:49,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444712674] [2021-10-11 00:33:49,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:49,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:49,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:49,668 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:49,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:49,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:49,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:49,775 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 4 states. [2021-10-11 00:33:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:49,801 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2021-10-11 00:33:49,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:33:49,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2021-10-11 00:33:49,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-10-11 00:33:49,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2021-10-11 00:33:49,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-10-11 00:33:49,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-10-11 00:33:49,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2021-10-11 00:33:49,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:49,804 INFO L692 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2021-10-11 00:33:49,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2021-10-11 00:33:49,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2021-10-11 00:33:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-11 00:33:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2021-10-11 00:33:49,806 INFO L715 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-10-11 00:33:49,806 INFO L595 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2021-10-11 00:33:49,807 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-11 00:33:49,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2021-10-11 00:33:49,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-10-11 00:33:49,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:49,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:49,808 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:49,808 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-10-11 00:33:49,808 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 176#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 177#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 178#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 171#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 168#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 169#L537-3 assume !(main_~k~0 < main_~array_size~0); 172#L537-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 167#L516-3 [2021-10-11 00:33:49,808 INFO L796 eck$LassoCheckResult]: Loop: 167#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 170#L518 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 175#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 173#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 174#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 166#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 167#L516-3 [2021-10-11 00:33:49,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:49,809 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-10-11 00:33:49,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:49,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217438734] [2021-10-11 00:33:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:49,820 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:49,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:49,833 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:49,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:49,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1807826313, now seen corresponding path program 2 times [2021-10-11 00:33:49,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:49,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723150735] [2021-10-11 00:33:49,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:49,841 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:49,846 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:49,848 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:49,849 INFO L82 PathProgramCache]: Analyzing trace with hash -260572169, now seen corresponding path program 1 times [2021-10-11 00:33:49,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:49,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336368950] [2021-10-11 00:33:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:49,864 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:49,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:49,882 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:50,331 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2021-10-11 00:33:50,449 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:33:50,450 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:33:50,450 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:33:50,450 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:33:50,454 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-11 00:33:50,455 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:50,458 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:33:50,458 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:33:50,459 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration3_Lasso [2021-10-11 00:33:50,459 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:33:50,459 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:33:50,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:33:50,641 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2021-10-11 00:33:50,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:33:50,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:33:50,721 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-11 00:33:50,725 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-11 00:33:50,728 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-11 00:33:50,731 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-11 00:33:50,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:33:50,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:33:50,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:33:50,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:33:50,750 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-11 00:33:50,753 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-11 00:33:50,756 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-11 00:33:50,760 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-11 00:33:50,763 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-11 00:33:50,767 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-11 00:33:50,770 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-11 00:33:50,919 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2021-10-11 00:33:51,217 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:33:51,217 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:33:51,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:51,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:51,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:51,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:51,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:51,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:33:51,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:51,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:33:51,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:51,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:51,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:51,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:51,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:51,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:33:51,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:51,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:51,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:51,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:51,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:51,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:51,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:51,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:33:51,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:33:51,373 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-11 00:33:51,418 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-10-11 00:33:51,418 INFO L444 ModelExtractionUtils]: 24 out of 37 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:51,477 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-11 00:33:51,503 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-11 00:33:51,503 INFO L510 LassoAnalysis]: Proved termination. [2021-10-11 00:33:51,503 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2021-10-11 00:33:51,542 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2021-10-11 00:33:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:51,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 00:33:51,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:51,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 00:33:51,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:51,623 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-11 00:33:51,623 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-11 00:33:51,623 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 3 states. [2021-10-11 00:33:51,654 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 22 states and 31 transitions. Complement of second has 4 states. [2021-10-11 00:33:51,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-10-11 00:33:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-11 00:33:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2021-10-11 00:33:51,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2021-10-11 00:33:51,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:33:51,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2021-10-11 00:33:51,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:33:51,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 12 letters. [2021-10-11 00:33:51,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:33:51,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2021-10-11 00:33:51,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-10-11 00:33:51,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 29 transitions. [2021-10-11 00:33:51,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-10-11 00:33:51,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-11 00:33:51,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2021-10-11 00:33:51,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-11 00:33:51,660 INFO L692 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-10-11 00:33:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2021-10-11 00:33:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-11 00:33:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-10-11 00:33:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-10-11 00:33:51,662 INFO L715 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-10-11 00:33:51,663 INFO L595 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-10-11 00:33:51,663 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-11 00:33:51,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-10-11 00:33:51,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-10-11 00:33:51,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:51,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:51,664 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:51,664 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-11 00:33:51,665 INFO L794 eck$LassoCheckResult]: Stem: 302#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 299#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 300#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 301#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 292#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 287#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 288#L537-3 assume !(main_~k~0 < main_~array_size~0); 293#L537-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 289#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 291#L518 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 295#L523-2 [2021-10-11 00:33:51,665 INFO L796 eck$LassoCheckResult]: Loop: 295#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 294#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 295#L523-2 [2021-10-11 00:33:51,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:51,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811566, now seen corresponding path program 1 times [2021-10-11 00:33:51,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:51,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995995296] [2021-10-11 00:33:51,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:51,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:51,713 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:51,719 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:51,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 1 times [2021-10-11 00:33:51,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:51,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990158219] [2021-10-11 00:33:51,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:51,724 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 00:33:51,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398946858] [2021-10-11 00:33:51,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:51,763 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:51,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:51,774 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash -357812649, now seen corresponding path program 1 times [2021-10-11 00:33:51,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:51,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155207239] [2021-10-11 00:33:51,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:51,784 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 00:33:51,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852140527] [2021-10-11 00:33:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:51,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 00:33:51,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:51,996 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2021-10-11 00:33:52,001 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:52,004 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:52,005 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-10-11 00:33:52,005 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2021-10-11 00:33:52,012 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-11 00:33:52,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155207239] [2021-10-11 00:33:52,013 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 00:33:52,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852140527] [2021-10-11 00:33:52,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:52,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:52,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15815422] [2021-10-11 00:33:52,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:52,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:33:52,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:33:52,056 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand 5 states. [2021-10-11 00:33:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:52,117 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2021-10-11 00:33:52,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:33:52,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2021-10-11 00:33:52,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-10-11 00:33:52,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 31 transitions. [2021-10-11 00:33:52,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-11 00:33:52,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-11 00:33:52,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2021-10-11 00:33:52,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-11 00:33:52,125 INFO L692 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2021-10-11 00:33:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2021-10-11 00:33:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-10-11 00:33:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-10-11 00:33:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2021-10-11 00:33:52,133 INFO L715 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-10-11 00:33:52,133 INFO L595 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-10-11 00:33:52,133 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-11 00:33:52,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2021-10-11 00:33:52,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-10-11 00:33:52,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:52,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:52,136 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:52,136 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-11 00:33:52,137 INFO L794 eck$LassoCheckResult]: Stem: 393#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 388#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 389#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 390#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 382#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 377#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 378#L537-3 assume !(main_~k~0 < main_~array_size~0); 383#L537-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 379#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 381#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 394#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 385#L523-2 [2021-10-11 00:33:52,137 INFO L796 eck$LassoCheckResult]: Loop: 385#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 384#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 385#L523-2 [2021-10-11 00:33:52,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:52,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2021-10-11 00:33:52,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:52,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464031516] [2021-10-11 00:33:52,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:52,166 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:52,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:52,206 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:52,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:52,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 2 times [2021-10-11 00:33:52,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:52,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155936363] [2021-10-11 00:33:52,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:52,210 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 00:33:52,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [21572484] [2021-10-11 00:33:52,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:52,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-11 00:33:52,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-10-11 00:33:52,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:52,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:52,278 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:52,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:52,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1792764442, now seen corresponding path program 1 times [2021-10-11 00:33:52,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:52,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993276666] [2021-10-11 00:33:52,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:52,306 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 00:33:52,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843917029] [2021-10-11 00:33:52,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:52,374 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:52,390 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:52,413 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:52,784 WARN L197 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2021-10-11 00:33:52,928 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-10-11 00:33:52,931 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:33:52,931 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:33:52,931 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:33:52,931 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:33:52,932 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-11 00:33:52,932 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:52,932 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:33:52,932 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:33:52,932 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration5_Lasso [2021-10-11 00:33:52,932 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:33:52,932 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:33:52,940 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-11 00:33:52,943 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-11 00:33:52,947 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-11 00:33:52,950 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-11 00:33:52,953 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-11 00:33:52,957 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-11 00:33:52,961 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-11 00:33:52,964 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-11 00:33:53,181 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2021-10-11 00:33:53,263 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-11 00:33:53,266 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-11 00:33:53,269 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-11 00:33:53,272 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-11 00:33:53,275 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-11 00:33:53,282 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-11 00:33:53,287 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-11 00:33:53,290 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-11 00:33:53,293 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-11 00:33:53,467 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2021-10-11 00:33:53,809 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:33:53,809 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:33:53,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:53,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:53,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:33:53,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:53,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:53,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:53,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:33:53,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:53,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:33:53,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:53,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:53,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:33:53,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:53,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:53,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:53,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:33:53,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:53,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:33:53,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:53,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:53,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:53,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:53,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:53,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:33:53,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:53,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:53,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:53,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:53,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:33:53,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:53,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:53,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:53,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:33:53,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:33:53,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:54,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:54,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:54,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:33:54,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:54,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:54,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:54,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:33:54,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:33:54,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:33:54,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:54,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:54,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:54,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:54,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:54,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:33:54,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:54,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:33:54,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:54,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:54,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:33:54,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:54,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:54,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:54,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:33:54,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:33:54,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:54,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:54,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:54,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:54,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:54,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:54,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:33:54,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:33:54,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:54,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:54,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:54,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:54,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:54,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:54,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:33:54,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:33:54,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:54,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:33:54,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:33:54,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:33:54,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:33:54,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:33:54,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-11 00:33:54,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-11 00:33:54,293 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-11 00:33:54,306 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-10-11 00:33:54,306 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:54,308 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-11 00:33:54,310 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-11 00:33:54,311 INFO L510 LassoAnalysis]: Proved termination. [2021-10-11 00:33:54,311 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1 Supporting invariants [] [2021-10-11 00:33:54,379 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-10-11 00:33:54,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:54,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 00:33:54,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:54,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-11 00:33:54,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:54,465 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-11 00:33:54,465 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-11 00:33:54,465 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 3 states. [2021-10-11 00:33:54,508 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 44 states and 59 transitions. Complement of second has 7 states. [2021-10-11 00:33:54,509 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-11 00:33:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-11 00:33:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2021-10-11 00:33:54,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 11 letters. Loop has 2 letters. [2021-10-11 00:33:54,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:33:54,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 13 letters. Loop has 2 letters. [2021-10-11 00:33:54,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:33:54,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 11 letters. Loop has 4 letters. [2021-10-11 00:33:54,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:33:54,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 59 transitions. [2021-10-11 00:33:54,518 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-10-11 00:33:54,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 39 states and 52 transitions. [2021-10-11 00:33:54,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-10-11 00:33:54,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-10-11 00:33:54,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 52 transitions. [2021-10-11 00:33:54,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-11 00:33:54,520 INFO L692 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2021-10-11 00:33:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 52 transitions. [2021-10-11 00:33:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2021-10-11 00:33:54,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-10-11 00:33:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2021-10-11 00:33:54,527 INFO L715 BuchiCegarLoop]: Abstraction has 35 states and 48 transitions. [2021-10-11 00:33:54,527 INFO L595 BuchiCegarLoop]: Abstraction has 35 states and 48 transitions. [2021-10-11 00:33:54,527 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-11 00:33:54,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 48 transitions. [2021-10-11 00:33:54,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-10-11 00:33:54,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:54,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:54,534 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:54,534 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-11 00:33:54,535 INFO L794 eck$LassoCheckResult]: Stem: 547#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 542#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 543#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 544#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 536#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 530#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 531#L537-3 assume !(main_~k~0 < main_~array_size~0); 537#L537-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 532#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 534#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 548#L520 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 539#L523-2 [2021-10-11 00:33:54,535 INFO L796 eck$LassoCheckResult]: Loop: 539#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 538#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 539#L523-2 [2021-10-11 00:33:54,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:54,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383699, now seen corresponding path program 1 times [2021-10-11 00:33:54,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:54,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521147519] [2021-10-11 00:33:54,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:54,560 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:54,573 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:54,585 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:54,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:54,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 3 times [2021-10-11 00:33:54,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:54,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907036708] [2021-10-11 00:33:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:54,596 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 00:33:54,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861332205] [2021-10-11 00:33:54,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:54,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-10-11 00:33:54,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-10-11 00:33:54,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:54,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:54,654 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:54,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1792762520, now seen corresponding path program 1 times [2021-10-11 00:33:54,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:54,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373847514] [2021-10-11 00:33:54,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:54,676 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 00:33:54,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57373994] [2021-10-11 00:33:54,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:54,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 00:33:54,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:54,780 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2021-10-11 00:33:54,782 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:54,784 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:54,784 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-10-11 00:33:54,785 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2021-10-11 00:33:54,794 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-11 00:33:54,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373847514] [2021-10-11 00:33:54,794 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 00:33:54,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57373994] [2021-10-11 00:33:54,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:54,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:54,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644681972] [2021-10-11 00:33:54,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:54,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:33:54,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:33:54,836 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. cyclomatic complexity: 18 Second operand 5 states. [2021-10-11 00:33:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:54,886 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2021-10-11 00:33:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:33:54,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2021-10-11 00:33:54,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-10-11 00:33:54,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 37 states and 46 transitions. [2021-10-11 00:33:54,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-11 00:33:54,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-11 00:33:54,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2021-10-11 00:33:54,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-11 00:33:54,890 INFO L692 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2021-10-11 00:33:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2021-10-11 00:33:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2021-10-11 00:33:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2021-10-11 00:33:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2021-10-11 00:33:54,893 INFO L715 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2021-10-11 00:33:54,893 INFO L595 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2021-10-11 00:33:54,893 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-11 00:33:54,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2021-10-11 00:33:54,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-10-11 00:33:54,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:54,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:54,894 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:54,895 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-11 00:33:54,895 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 665#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 666#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 667#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 659#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 654#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 655#L537-3 assume !(main_~k~0 < main_~array_size~0); 660#L537-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 656#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 657#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 681#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 664#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 669#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 674#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 652#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 653#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 675#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 671#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 662#L523-2 [2021-10-11 00:33:54,895 INFO L796 eck$LassoCheckResult]: Loop: 662#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 661#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 662#L523-2 [2021-10-11 00:33:54,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:54,895 INFO L82 PathProgramCache]: Analyzing trace with hash 869045162, now seen corresponding path program 1 times [2021-10-11 00:33:54,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:54,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216386075] [2021-10-11 00:33:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:54,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216386075] [2021-10-11 00:33:54,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671396509] [2021-10-11 00:33:54,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:55,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 00:33:55,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:55,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:33:55,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-10-11 00:33:55,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453387900] [2021-10-11 00:33:55,171 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:33:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:55,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 4 times [2021-10-11 00:33:55,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:55,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937279382] [2021-10-11 00:33:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:55,192 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 00:33:55,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1026502778] [2021-10-11 00:33:55,192 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:55,244 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 00:33:55,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-10-11 00:33:55,245 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:55,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:55,253 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:55,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:55,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-11 00:33:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-11 00:33:55,295 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. cyclomatic complexity: 14 Second operand 12 states. [2021-10-11 00:33:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:55,501 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2021-10-11 00:33:55,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 00:33:55,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2021-10-11 00:33:55,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-10-11 00:33:55,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 34 states and 42 transitions. [2021-10-11 00:33:55,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-11 00:33:55,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-11 00:33:55,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2021-10-11 00:33:55,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-11 00:33:55,505 INFO L692 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2021-10-11 00:33:55,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2021-10-11 00:33:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-10-11 00:33:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2021-10-11 00:33:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2021-10-11 00:33:55,508 INFO L715 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-10-11 00:33:55,508 INFO L595 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-10-11 00:33:55,508 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-11 00:33:55,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2021-10-11 00:33:55,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-10-11 00:33:55,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:55,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:55,509 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:55,510 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-11 00:33:55,510 INFO L794 eck$LassoCheckResult]: Stem: 828#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 823#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 824#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 825#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 816#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 812#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 813#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 817#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 836#L537-3 assume !(main_~k~0 < main_~array_size~0); 822#L537-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 814#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 815#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 841#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 821#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 827#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 832#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 833#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 837#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 834#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 829#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 819#L523-2 [2021-10-11 00:33:55,510 INFO L796 eck$LassoCheckResult]: Loop: 819#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 818#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 819#L523-2 [2021-10-11 00:33:55,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:55,511 INFO L82 PathProgramCache]: Analyzing trace with hash -185139956, now seen corresponding path program 2 times [2021-10-11 00:33:55,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:55,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977665197] [2021-10-11 00:33:55,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 00:33:55,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977665197] [2021-10-11 00:33:55,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:55,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:33:55,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760366954] [2021-10-11 00:33:55,560 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:33:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 5 times [2021-10-11 00:33:55,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:55,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363522647] [2021-10-11 00:33:55,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:55,563 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 00:33:55,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [736612767] [2021-10-11 00:33:55,563 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:55,624 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-11 00:33:55,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-10-11 00:33:55,624 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:55,629 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:55,633 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:55,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:55,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:33:55,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:33:55,673 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. cyclomatic complexity: 13 Second operand 6 states. [2021-10-11 00:33:55,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:55,721 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2021-10-11 00:33:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:33:55,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2021-10-11 00:33:55,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-10-11 00:33:55,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 47 transitions. [2021-10-11 00:33:55,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2021-10-11 00:33:55,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2021-10-11 00:33:55,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2021-10-11 00:33:55,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-11 00:33:55,733 INFO L692 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2021-10-11 00:33:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2021-10-11 00:33:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2021-10-11 00:33:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-10-11 00:33:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2021-10-11 00:33:55,736 INFO L715 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2021-10-11 00:33:55,736 INFO L595 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2021-10-11 00:33:55,736 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-11 00:33:55,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2021-10-11 00:33:55,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-10-11 00:33:55,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:55,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:55,738 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:55,738 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-11 00:33:55,738 INFO L794 eck$LassoCheckResult]: Stem: 912#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 907#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet12, main_#t~post11, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 908#L532 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 909#L532-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;main_~k~0 := 0; 900#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 896#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 897#L537-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet12, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet12; 901#L537-2 main_#t~post11 := main_~k~0;main_~k~0 := 1 + main_#t~post11;havoc main_#t~post11; 921#L537-3 assume !(main_~k~0 < main_~array_size~0); 906#L537-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 898#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 899#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 926#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 910#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 911#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 929#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 927#L523 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 917#L523-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 918#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 922#L516-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 919#L518 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 913#L520 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 903#L523-2 [2021-10-11 00:33:55,738 INFO L796 eck$LassoCheckResult]: Loop: 903#L523-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 902#L523 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 903#L523-2 [2021-10-11 00:33:55,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:55,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2055932007, now seen corresponding path program 1 times [2021-10-11 00:33:55,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:55,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283913856] [2021-10-11 00:33:55,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:55,746 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 00:33:55,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324219498] [2021-10-11 00:33:55,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:55,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:55,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:55,852 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:55,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:55,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 6 times [2021-10-11 00:33:55,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:55,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009366318] [2021-10-11 00:33:55,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:55,856 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 00:33:55,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [812981549] [2021-10-11 00:33:55,856 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:55,893 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-10-11 00:33:55,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-10-11 00:33:55,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:55,898 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:55,902 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash 65704044, now seen corresponding path program 2 times [2021-10-11 00:33:55,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:55,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280518584] [2021-10-11 00:33:55,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:55,910 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-10-11 00:33:55,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726319817] [2021-10-11 00:33:55,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df41a68f-88d3-4fb5-90ca-154bbd73fbeb/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:56,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-11 00:33:56,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-10-11 00:33:56,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:56,027 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:56,064 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:56,788 WARN L197 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 137 [2021-10-11 00:33:56,947 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-10-11 00:33:56,950 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:33:56,950 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:33:56,951 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:33:56,951 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:33:56,951 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-11 00:33:56,951 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:33:56,951 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:33:56,951 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:33:56,951 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-2.i_Iteration9_Lasso [2021-10-11 00:33:56,952 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:33:56,952 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:33:56,955 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-11 00:33:56,984 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:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) 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-11 00:33:56,987 INFO L168 Benchmark]: Toolchain (without parser) took 10304.92 ms. Allocated memory was 111.1 MB in the beginning and 201.3 MB in the end (delta: 90.2 MB). Free memory was 79.6 MB in the beginning and 140.1 MB in the end (delta: -60.5 MB). Peak memory consumption was 90.7 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:56,987 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 81.8 MB. Free memory is still 40.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:33:56,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.55 ms. Allocated memory is still 111.1 MB. Free memory was 79.3 MB in the beginning and 76.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:56,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.86 ms. Allocated memory is still 111.1 MB. Free memory was 76.6 MB in the beginning and 75.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:56,988 INFO L168 Benchmark]: Boogie Preprocessor took 26.93 ms. Allocated memory is still 111.1 MB. Free memory was 75.0 MB in the beginning and 73.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:56,988 INFO L168 Benchmark]: RCFGBuilder took 459.21 ms. Allocated memory is still 111.1 MB. Free memory was 73.4 MB in the beginning and 57.6 MB in the end (delta: 15.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:56,989 INFO L168 Benchmark]: BuchiAutomizer took 9178.66 ms. Allocated memory was 111.1 MB in the beginning and 201.3 MB in the end (delta: 90.2 MB). Free memory was 57.1 MB in the beginning and 140.1 MB in the end (delta: -83.0 MB). Peak memory consumption was 70.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:56,991 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 81.8 MB. Free memory is still 40.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 593.55 ms. Allocated memory is still 111.1 MB. Free memory was 79.3 MB in the beginning and 76.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.86 ms. Allocated memory is still 111.1 MB. Free memory was 76.6 MB in the beginning and 75.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.93 ms. Allocated memory is still 111.1 MB. Free memory was 75.0 MB in the beginning and 73.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 459.21 ms. Allocated memory is still 111.1 MB. Free memory was 73.4 MB in the beginning and 57.6 MB in the end (delta: 15.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 9178.66 ms. Allocated memory was 111.1 MB in the beginning and 201.3 MB in the end (delta: 90.2 MB). Free memory was 57.1 MB in the beginning and 140.1 MB in the end (delta: -83.0 MB). Peak memory consumption was 70.5 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. Received shutdown request...