./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc --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 64bit --witnessprinter.graph.data.programhash a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:55:03,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:55:03,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:55:03,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:55:03,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:55:03,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:55:03,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:55:03,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:55:03,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:55:03,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:55:03,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:55:03,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:55:03,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:55:04,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:55:04,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:55:04,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:55:04,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:55:04,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:55:04,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:55:04,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:55:04,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:55:04,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:55:04,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:55:04,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:55:04,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:55:04,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:55:04,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:55:04,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:55:04,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:55:04,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:55:04,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:55:04,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:55:04,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:55:04,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:55:04,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:55:04,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:55:04,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:55:04,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:55:04,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:55:04,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:55:04,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:55:04,032 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-02 20:55:04,073 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:55:04,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:55:04,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:55:04,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:55:04,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:55:04,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:55:04,076 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:55:04,076 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-02 20:55:04,076 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-02 20:55:04,077 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-02 20:55:04,078 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-02 20:55:04,078 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-02 20:55:04,078 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-02 20:55:04,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:55:04,079 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:55:04,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:55:04,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:55:04,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-02 20:55:04,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-02 20:55:04,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-02 20:55:04,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:55:04,080 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-02 20:55:04,080 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:55:04,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-02 20:55:04,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:55:04,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:55:04,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:55:04,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:55:04,082 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-02 20:55:04,083 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_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/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_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a88178fc87721f9fcc743f79bc2a47ff45a89438b0709780ae0f715015934520 [2022-11-02 20:55:04,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:55:04,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:55:04,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:55:04,474 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:55:04,475 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:55:04,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2022-11-02 20:55:04,538 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/data/3604e6bf1/96e45b04f1f5423298d6fc495e63ca99/FLAG55b4c9095 [2022-11-02 20:55:05,096 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:55:05,097 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2022-11-02 20:55:05,108 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/data/3604e6bf1/96e45b04f1f5423298d6fc495e63ca99/FLAG55b4c9095 [2022-11-02 20:55:05,426 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/data/3604e6bf1/96e45b04f1f5423298d6fc495e63ca99 [2022-11-02 20:55:05,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:55:05,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:55:05,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:55:05,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:55:05,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:55:05,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:55:05" (1/1) ... [2022-11-02 20:55:05,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6629117c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05, skipping insertion in model container [2022-11-02 20:55:05,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:55:05" (1/1) ... [2022-11-02 20:55:05,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:55:05,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:55:05,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:55:05,831 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:55:05,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:55:05,925 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:55:05,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05 WrapperNode [2022-11-02 20:55:05,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:55:05,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:55:05,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:55:05,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:55:05,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05" (1/1) ... [2022-11-02 20:55:05,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05" (1/1) ... [2022-11-02 20:55:05,992 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2022-11-02 20:55:05,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:55:05,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:55:05,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:55:05,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:55:06,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05" (1/1) ... [2022-11-02 20:55:06,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05" (1/1) ... [2022-11-02 20:55:06,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05" (1/1) ... [2022-11-02 20:55:06,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05" (1/1) ... [2022-11-02 20:55:06,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05" (1/1) ... [2022-11-02 20:55:06,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05" (1/1) ... [2022-11-02 20:55:06,030 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05" (1/1) ... [2022-11-02 20:55:06,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05" (1/1) ... [2022-11-02 20:55:06,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:55:06,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:55:06,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:55:06,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:55:06,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05" (1/1) ... [2022-11-02 20:55:06,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:06,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:06,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:06,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-02 20:55:06,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:55:06,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:55:06,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:55:06,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:55:06,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:55:06,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:55:06,261 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:55:06,263 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:55:06,431 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:55:06,437 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:55:06,437 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:55:06,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:06 BoogieIcfgContainer [2022-11-02 20:55:06,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:55:06,440 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-02 20:55:06,440 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-02 20:55:06,444 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-02 20:55:06,445 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:55:06,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 08:55:05" (1/3) ... [2022-11-02 20:55:06,446 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14f21831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:55:06, skipping insertion in model container [2022-11-02 20:55:06,446 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:55:06,446 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:05" (2/3) ... [2022-11-02 20:55:06,447 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14f21831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:55:06, skipping insertion in model container [2022-11-02 20:55:06,447 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:55:06,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:06" (3/3) ... [2022-11-02 20:55:06,449 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2022-11-02 20:55:06,514 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-02 20:55:06,529 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-02 20:55:06,530 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-02 20:55:06,530 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-02 20:55:06,530 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-02 20:55:06,530 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-02 20:55:06,530 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-02 20:55:06,531 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-02 20:55:06,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:06,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-11-02 20:55:06,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:55:06,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:55:06,559 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-02 20:55:06,559 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 20:55:06,559 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-02 20:55:06,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:06,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-11-02 20:55:06,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:55:06,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:55:06,566 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-02 20:55:06,566 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-11-02 20:55:06,574 INFO L748 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 12#L558true assume !(main_~array_size~0#1 < 1); 7#L558-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 14#L562-3true [2022-11-02 20:55:06,575 INFO L750 eck$LassoCheckResult]: Loop: 14#L562-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 16#L562-2true main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14#L562-3true [2022-11-02 20:55:06,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:06,586 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-11-02 20:55:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:06,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446785213] [2022-11-02 20:55:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:06,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:06,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:06,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-11-02 20:55:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:06,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401079147] [2022-11-02 20:55:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:06,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:06,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:06,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:06,845 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-11-02 20:55:06,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:06,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493143286] [2022-11-02 20:55:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:06,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:06,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:06,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:07,182 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:55:07,182 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:55:07,183 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:55:07,183 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:55:07,183 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:55:07,183 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:07,184 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:55:07,184 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:55:07,184 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration1_Lasso [2022-11-02 20:55:07,184 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:55:07,185 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:55:07,209 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:07,220 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:07,225 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:07,228 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:07,234 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:07,438 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:07,442 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:07,447 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:07,451 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:07,790 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:55:07,795 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:55:07,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:07,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:07,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:07,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:07,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:07,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:55:07,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:07,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:07,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:07,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:55:07,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:55:07,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-02 20:55:07,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:07,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:07,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:07,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:07,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:07,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:07,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:07,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:07,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:07,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:07,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-02 20:55:07,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:07,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:07,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:07,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:07,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:07,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:07,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:07,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-02 20:55:07,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:07,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:07,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:55:07,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:07,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:07,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:07,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:55:07,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:55:07,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:08,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-11-02 20:55:08,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:08,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:08,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:08,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-02 20:55:08,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:08,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:08,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:08,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:08,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:08,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:08,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:08,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:08,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:08,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:08,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:08,109 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:08,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:08,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-02 20:55:08,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:08,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:55:08,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:08,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:08,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:08,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:55:08,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:55:08,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:08,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:08,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:08,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:08,179 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:08,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:08,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:08,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:08,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:08,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:08,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-02 20:55:08,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:08,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:08,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:08,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:08,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:08,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:08,267 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:08,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:08,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:08,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:08,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:08,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:08,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:08,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:08,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-02 20:55:08,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:08,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-11-02 20:55:08,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:08,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:08,350 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:08,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-02 20:55:08,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:08,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:08,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:08,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:08,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:08,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:08,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:08,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:08,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:08,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:08,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:08,415 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:08,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:08,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-02 20:55:08,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:08,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:55:08,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:08,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:08,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:08,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:55:08,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:55:08,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:08,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:08,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:08,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:08,470 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:08,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-02 20:55:08,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:08,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:08,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:08,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:08,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:08,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:08,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:08,513 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:55:08,562 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-11-02 20:55:08,562 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-11-02 20:55:08,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:08,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:08,582 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:08,639 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:55:08,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-02 20:55:08,679 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-11-02 20:55:08,679 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:55:08,680 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_1 - 4*ULTIMATE.start_main_~i~1#1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0#1.offset >= 0] [2022-11-02 20:55:08,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:08,762 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2022-11-02 20:55:08,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:08,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:55:08,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:08,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:55:08,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:08,934 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-02 20:55:08,937 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:09,039 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 56 transitions. Complement of second has 7 states. [2022-11-02 20:55:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-02 20:55:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-11-02 20:55:09,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2022-11-02 20:55:09,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:09,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2022-11-02 20:55:09,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:09,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2022-11-02 20:55:09,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:09,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2022-11-02 20:55:09,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:55:09,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 13 states and 18 transitions. [2022-11-02 20:55:09,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-11-02 20:55:09,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-11-02 20:55:09,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2022-11-02 20:55:09,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:09,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-11-02 20:55:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2022-11-02 20:55:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-02 20:55:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-11-02 20:55:09,085 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-11-02 20:55:09,086 INFO L428 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-11-02 20:55:09,086 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-02 20:55:09,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-11-02 20:55:09,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-11-02 20:55:09,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:55:09,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:55:09,087 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:55:09,087 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:55:09,088 INFO L748 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 122#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 125#L558 assume !(main_~array_size~0#1 < 1); 126#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 129#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 119#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 120#L550-3 [2022-11-02 20:55:09,088 INFO L750 eck$LassoCheckResult]: Loop: 120#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 124#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 127#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 120#L550-3 [2022-11-02 20:55:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:09,089 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-11-02 20:55:09,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:09,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768140866] [2022-11-02 20:55:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:09,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:09,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:09,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:09,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768140866] [2022-11-02 20:55:09,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768140866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:09,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:09,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:55:09,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761866116] [2022-11-02 20:55:09,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:09,174 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:55:09,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2022-11-02 20:55:09,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:09,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796492445] [2022-11-02 20:55:09,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:09,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:09,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:09,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796492445] [2022-11-02 20:55:09,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796492445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:09,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:09,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:09,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225293605] [2022-11-02 20:55:09,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:09,199 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:55:09,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:09,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:09,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:09,203 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:09,220 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-11-02 20:55:09,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-11-02 20:55:09,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-02 20:55:09,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2022-11-02 20:55:09,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-11-02 20:55:09,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-11-02 20:55:09,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-11-02 20:55:09,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:09,223 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-11-02 20:55:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-11-02 20:55:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-02 20:55:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:09,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2022-11-02 20:55:09,229 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-11-02 20:55:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:09,230 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-11-02 20:55:09,230 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-02 20:55:09,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2022-11-02 20:55:09,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-02 20:55:09,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:55:09,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:55:09,232 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:55:09,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:55:09,234 INFO L748 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 160#L558 assume !(main_~array_size~0#1 < 1); 161#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 164#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 154#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 155#L550-3 [2022-11-02 20:55:09,235 INFO L750 eck$LassoCheckResult]: Loop: 155#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 162#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 163#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 158#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 159#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 167#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 155#L550-3 [2022-11-02 20:55:09,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:09,236 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2022-11-02 20:55:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:09,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728824529] [2022-11-02 20:55:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:09,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:09,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:09,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728824529] [2022-11-02 20:55:09,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728824529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:09,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:09,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:55:09,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371870786] [2022-11-02 20:55:09,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:09,342 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:55:09,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:09,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 1 times [2022-11-02 20:55:09,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:09,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235579896] [2022-11-02 20:55:09,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:09,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:09,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:09,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:09,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:55:09,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:55:09,557 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:09,584 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-11-02 20:55:09,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-11-02 20:55:09,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-02 20:55:09,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2022-11-02 20:55:09,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-11-02 20:55:09,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-11-02 20:55:09,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2022-11-02 20:55:09,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:09,586 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-11-02 20:55:09,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2022-11-02 20:55:09,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-11-02 20:55:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2022-11-02 20:55:09,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-11-02 20:55:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:55:09,591 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2022-11-02 20:55:09,592 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-02 20:55:09,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2022-11-02 20:55:09,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-02 20:55:09,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:55:09,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:55:09,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:09,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:55:09,596 INFO L748 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 196#L558 assume !(main_~array_size~0#1 < 1); 197#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 200#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 201#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 202#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 190#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 191#L550-3 [2022-11-02 20:55:09,596 INFO L750 eck$LassoCheckResult]: Loop: 191#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 198#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 199#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 194#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 195#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 203#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 191#L550-3 [2022-11-02 20:55:09,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:09,597 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-11-02 20:55:09,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:09,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783674315] [2022-11-02 20:55:09,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:09,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:09,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:09,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:09,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:09,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 2 times [2022-11-02 20:55:09,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:09,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778882383] [2022-11-02 20:55:09,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:09,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:09,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:09,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:09,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:09,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash -256077176, now seen corresponding path program 1 times [2022-11-02 20:55:09,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:09,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805632627] [2022-11-02 20:55:09,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:09,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:55:09,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:09,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805632627] [2022-11-02 20:55:09,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805632627] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:09,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407186000] [2022-11-02 20:55:09,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:09,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:09,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:09,931 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:09,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:55:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:09,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:55:09,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:55:10,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:55:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:55:10,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407186000] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:55:10,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:55:10,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-11-02 20:55:10,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50043783] [2022-11-02 20:55:10,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:55:10,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:10,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:55:10,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:55:10,216 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:10,338 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-11-02 20:55:10,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2022-11-02 20:55:10,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-02 20:55:10,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2022-11-02 20:55:10,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-11-02 20:55:10,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-11-02 20:55:10,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2022-11-02 20:55:10,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:10,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-11-02 20:55:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2022-11-02 20:55:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-11-02 20:55:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-11-02 20:55:10,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-11-02 20:55:10,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:55:10,343 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-11-02 20:55:10,343 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-02 20:55:10,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-11-02 20:55:10,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-02 20:55:10,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:55:10,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:55:10,345 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:10,345 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:55:10,345 INFO L748 eck$LassoCheckResult]: Stem: 330#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 331#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 334#L558 assume !(main_~array_size~0#1 < 1); 335#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 338#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 339#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 340#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 341#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 343#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 328#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 329#L550-3 [2022-11-02 20:55:10,345 INFO L750 eck$LassoCheckResult]: Loop: 329#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 336#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 337#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 332#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 333#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 342#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 329#L550-3 [2022-11-02 20:55:10,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:10,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2022-11-02 20:55:10,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:10,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072272748] [2022-11-02 20:55:10,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:10,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:10,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:10,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1812321306, now seen corresponding path program 3 times [2022-11-02 20:55:10,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:10,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261389413] [2022-11-02 20:55:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:10,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:10,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:10,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1808202986, now seen corresponding path program 2 times [2022-11-02 20:55:10,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:10,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366945039] [2022-11-02 20:55:10,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:10,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:10,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:10,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:10,976 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:55:10,977 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:55:10,978 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:55:10,978 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:55:10,978 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:55:10,978 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:10,978 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:55:10,978 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:55:10,978 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration5_Lasso [2022-11-02 20:55:10,978 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:55:10,979 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:55:10,985 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,312 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,314 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,318 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,322 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,324 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,327 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,331 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,334 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,336 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,338 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,341 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,345 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,347 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,349 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,352 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:11,805 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:55:11,805 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:55:11,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:11,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:11,806 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:11,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:11,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:11,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:11,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:11,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:11,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-02 20:55:11,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:11,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:11,890 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:55:11,945 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-11-02 20:55:11,945 INFO L444 ModelExtractionUtils]: 22 out of 40 variables were initially zero. Simplification set additionally 15 variables to zero. [2022-11-02 20:55:11,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:11,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:11,974 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:12,012 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:55:12,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-02 20:55:12,030 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-02 20:55:12,030 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:55:12,030 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~pass~0#1) = 1*ULTIMATE.start_sort_~n#1 - 1*ULTIMATE.start_sort_~pass~0#1 Supporting invariants [] [2022-11-02 20:55:12,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:12,094 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-11-02 20:55:12,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:12,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:55:12,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:12,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:55:12,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:55:12,199 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-02 20:55:12,199 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,220 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 28 transitions. Complement of second has 4 states. [2022-11-02 20:55:12,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-11-02 20:55:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-11-02 20:55:12,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2022-11-02 20:55:12,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:12,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 16 letters. Loop has 6 letters. [2022-11-02 20:55:12,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:12,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 12 letters. [2022-11-02 20:55:12,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:12,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2022-11-02 20:55:12,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-02 20:55:12,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2022-11-02 20:55:12,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-11-02 20:55:12,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-11-02 20:55:12,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-11-02 20:55:12,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:55:12,233 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-11-02 20:55:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-11-02 20:55:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-11-02 20:55:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-11-02 20:55:12,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-11-02 20:55:12,238 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-11-02 20:55:12,238 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-02 20:55:12,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-11-02 20:55:12,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-02 20:55:12,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:55:12,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:55:12,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:12,241 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:55:12,241 INFO L748 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 460#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 465#L558 assume !(main_~array_size~0#1 < 1); 466#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 471#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 472#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 473#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 474#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 476#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 457#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 458#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 462#L551-3 [2022-11-02 20:55:12,241 INFO L750 eck$LassoCheckResult]: Loop: 462#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 467#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 461#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 462#L551-3 [2022-11-02 20:55:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2022-11-02 20:55:12,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:12,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247326336] [2022-11-02 20:55:12,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:12,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:12,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:12,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:12,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:12,279 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2022-11-02 20:55:12,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:12,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078610267] [2022-11-02 20:55:12,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:12,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:12,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:12,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:12,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:12,295 INFO L85 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2022-11-02 20:55:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:12,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212359285] [2022-11-02 20:55:12,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:12,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:12,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:12,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:12,868 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:55:12,869 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:55:12,869 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:55:12,869 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:55:12,869 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:55:12,869 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:12,869 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:55:12,869 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:55:12,869 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration6_Lasso [2022-11-02 20:55:12,870 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:55:12,870 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:55:12,873 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:12,877 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:12,880 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:12,883 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:12,885 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:12,887 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:12,890 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:12,893 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:13,287 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:13,290 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:13,292 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:13,295 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:13,297 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:13,300 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:13,302 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:13,304 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:13,307 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:13,748 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:55:13,748 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:55:13,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:13,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:13,754 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:13,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-02 20:55:13,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:13,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:13,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:13,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:13,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:13,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:13,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:13,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:13,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:13,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:13,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:13,819 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:13,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-02 20:55:13,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:13,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:13,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:55:13,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:13,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:13,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:13,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:55:13,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:55:13,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:13,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-11-02 20:55:13,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:13,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:13,857 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:13,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-02 20:55:13,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:13,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:13,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:13,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:13,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:13,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:13,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:13,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:13,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:13,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:13,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:13,915 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:13,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-02 20:55:13,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:13,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:13,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:55:13,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:13,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:13,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:13,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:55:13,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:55:13,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:13,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:13,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:13,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:13,999 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:14,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:14,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:14,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:55:14,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:14,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:14,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:14,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:55:14,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:55:14,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-02 20:55:14,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:14,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:14,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:14,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:14,059 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:14,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-02 20:55:14,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:14,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:14,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:14,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:14,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:14,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:14,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:14,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:14,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:14,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:14,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:14,135 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:14,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-02 20:55:14,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:14,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:14,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:14,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:14,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:14,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:14,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:14,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:14,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:14,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:14,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:14,189 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:14,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-02 20:55:14,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:14,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:14,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:14,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:14,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:14,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:14,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:14,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:14,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:14,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:14,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:14,277 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:14,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:14,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:14,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:14,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:14,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:14,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-02 20:55:14,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:14,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:14,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:14,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:14,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:14,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:14,361 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:14,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:14,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:14,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:14,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:14,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:14,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-02 20:55:14,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:14,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:14,418 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:55:14,473 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-11-02 20:55:14,473 INFO L444 ModelExtractionUtils]: 11 out of 40 variables were initially zero. Simplification set additionally 25 variables to zero. [2022-11-02 20:55:14,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:14,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:14,474 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:14,475 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:55:14,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-02 20:55:14,493 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-11-02 20:55:14,493 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:55:14,493 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_3) = -4*ULTIMATE.start_sort_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_3 Supporting invariants [1*ULTIMATE.start_sort_~x#1.offset >= 0] [2022-11-02 20:55:14,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:14,540 INFO L156 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2022-11-02 20:55:14,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:14,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:55:14,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:14,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:14,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:55:14,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:14,771 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-11-02 20:55:14,771 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,841 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 50 transitions. Complement of second has 9 states. [2022-11-02 20:55:14,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-02 20:55:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-11-02 20:55:14,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2022-11-02 20:55:14,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:14,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2022-11-02 20:55:14,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:14,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2022-11-02 20:55:14,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:14,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2022-11-02 20:55:14,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-02 20:55:14,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 34 transitions. [2022-11-02 20:55:14,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-11-02 20:55:14,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-11-02 20:55:14,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2022-11-02 20:55:14,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:55:14,855 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-11-02 20:55:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2022-11-02 20:55:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2022-11-02 20:55:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-11-02 20:55:14,857 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-11-02 20:55:14,858 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-11-02 20:55:14,858 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-02 20:55:14,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-11-02 20:55:14,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-02 20:55:14,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:55:14,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:55:14,862 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:14,863 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:55:14,863 INFO L748 eck$LassoCheckResult]: Stem: 623#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 624#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 629#L558 assume !(main_~array_size~0#1 < 1); 630#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 635#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 636#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 637#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 638#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 640#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 621#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 622#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 632#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 633#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 627#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 628#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 639#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 634#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 626#L551-3 [2022-11-02 20:55:14,863 INFO L750 eck$LassoCheckResult]: Loop: 626#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 631#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 625#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 626#L551-3 [2022-11-02 20:55:14,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:14,864 INFO L85 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2022-11-02 20:55:14,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:14,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768378506] [2022-11-02 20:55:14,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:55:15,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:15,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768378506] [2022-11-02 20:55:15,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768378506] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:15,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430448232] [2022-11-02 20:55:15,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:15,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:15,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:15,045 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:15,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-02 20:55:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:15,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:55:15,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:55:15,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:55:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:55:15,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430448232] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:55:15,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:55:15,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-02 20:55:15,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252379539] [2022-11-02 20:55:15,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:55:15,266 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:55:15,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2022-11-02 20:55:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:15,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608375884] [2022-11-02 20:55:15,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:15,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:15,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:15,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:55:15,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:15,380 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:15,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:15,465 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-11-02 20:55:15,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2022-11-02 20:55:15,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-02 20:55:15,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 28 transitions. [2022-11-02 20:55:15,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-11-02 20:55:15,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-11-02 20:55:15,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2022-11-02 20:55:15,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:55:15,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-11-02 20:55:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2022-11-02 20:55:15,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-11-02 20:55:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-11-02 20:55:15,470 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-11-02 20:55:15,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:55:15,472 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-11-02 20:55:15,472 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-02 20:55:15,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-11-02 20:55:15,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-02 20:55:15,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:55:15,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:55:15,474 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:15,474 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:55:15,474 INFO L748 eck$LassoCheckResult]: Stem: 791#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 792#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 797#L558 assume !(main_~array_size~0#1 < 1); 798#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 803#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 804#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 805#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 806#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 808#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 810#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 809#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 789#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 790#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 800#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 801#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 795#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 796#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 807#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 802#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 794#L551-3 [2022-11-02 20:55:15,474 INFO L750 eck$LassoCheckResult]: Loop: 794#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 799#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 793#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 794#L551-3 [2022-11-02 20:55:15,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2022-11-02 20:55:15,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:15,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396151519] [2022-11-02 20:55:15,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:15,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:15,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:15,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396151519] [2022-11-02 20:55:15,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396151519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:15,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495096194] [2022-11-02 20:55:15,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:55:15,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:15,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:15,625 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:15,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-02 20:55:15,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:55:15,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:55:15,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:55:15,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:55:15,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:55:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:55:15,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495096194] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:55:15,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:55:15,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2022-11-02 20:55:15,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630734329] [2022-11-02 20:55:15,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:55:15,807 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:55:15,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:15,807 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2022-11-02 20:55:15,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:15,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123620506] [2022-11-02 20:55:15,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:15,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:15,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:15,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:15,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:15,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:55:15,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:55:15,925 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:16,160 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-11-02 20:55:16,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2022-11-02 20:55:16,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-02 20:55:16,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 43 states and 56 transitions. [2022-11-02 20:55:16,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-11-02 20:55:16,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-11-02 20:55:16,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 56 transitions. [2022-11-02 20:55:16,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:55:16,162 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 56 transitions. [2022-11-02 20:55:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 56 transitions. [2022-11-02 20:55:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2022-11-02 20:55:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-11-02 20:55:16,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-11-02 20:55:16,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:55:16,165 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-11-02 20:55:16,165 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-02 20:55:16,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2022-11-02 20:55:16,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-02 20:55:16,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:55:16,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:55:16,167 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:16,167 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:55:16,167 INFO L748 eck$LassoCheckResult]: Stem: 1002#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1003#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1008#L558 assume !(main_~array_size~0#1 < 1); 1009#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1014#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1015#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1016#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1017#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1020#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1022#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1021#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1000#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1001#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1012#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1024#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1006#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1007#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1011#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1018#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1023#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1019#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1013#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1005#L551-3 [2022-11-02 20:55:16,167 INFO L750 eck$LassoCheckResult]: Loop: 1005#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1010#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1004#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1005#L551-3 [2022-11-02 20:55:16,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:16,168 INFO L85 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2022-11-02 20:55:16,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:16,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938733893] [2022-11-02 20:55:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:16,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:16,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:16,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2022-11-02 20:55:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:16,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051795329] [2022-11-02 20:55:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:16,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:16,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:16,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:16,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 1 times [2022-11-02 20:55:16,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:16,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416596791] [2022-11-02 20:55:16,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:16,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:55:17,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:17,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416596791] [2022-11-02 20:55:17,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416596791] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:17,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743750310] [2022-11-02 20:55:17,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:17,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:17,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:17,010 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:17,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-02 20:55:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:17,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:55:17,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:17,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:55:17,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2022-11-02 20:55:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:55:17,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:55:17,399 INFO L356 Elim1Store]: treesize reduction 15, result has 65.1 percent of original size [2022-11-02 20:55:17,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 34 [2022-11-02 20:55:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:55:17,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743750310] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:55:17,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:55:17,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 21 [2022-11-02 20:55:17,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601059896] [2022-11-02 20:55:17,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:55:17,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:17,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-02 20:55:17,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:55:17,542 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:17,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:17,828 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-11-02 20:55:17,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2022-11-02 20:55:17,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-11-02 20:55:17,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 58 transitions. [2022-11-02 20:55:17,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-11-02 20:55:17,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-11-02 20:55:17,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2022-11-02 20:55:17,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:55:17,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 58 transitions. [2022-11-02 20:55:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2022-11-02 20:55:17,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-11-02 20:55:17,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:17,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-11-02 20:55:17,835 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-11-02 20:55:17,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:55:17,836 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-11-02 20:55:17,836 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-02 20:55:17,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2022-11-02 20:55:17,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-11-02 20:55:17,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:55:17,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:55:17,838 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:17,838 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:55:17,838 INFO L748 eck$LassoCheckResult]: Stem: 1259#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1260#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet11#1, main_#t~post10#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1265#L558 assume !(main_~array_size~0#1 < 1); 1266#L558-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0; 1273#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1274#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1275#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1276#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1284#L562-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet11#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet11#1; 1283#L562-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1282#L562-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1257#L562-4 assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem4#1, sort_#t~mem5#1, sort_#t~mem6#1, sort_#t~mem7#1, sort_~temp~0#1, sort_#t~post3#1, sort_#t~post2#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1; 1258#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1269#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1288#L552 assume !(sort_#t~mem4#1 > sort_#t~mem5#1);havoc sort_#t~mem4#1;havoc sort_#t~mem5#1; 1263#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1264#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1268#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1278#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1287#L551-3 assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1); 1280#L550-2 sort_#t~post2#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post2#1;havoc sort_#t~post2#1; 1281#L550-3 assume !!(sort_~pass~0#1 < sort_~n#1);sort_~i~0#1 := 0; 1262#L551-3 [2022-11-02 20:55:17,838 INFO L750 eck$LassoCheckResult]: Loop: 1262#L551-3 assume !!(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);call sort_#t~mem4#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem5#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1267#L552 assume sort_#t~mem4#1 > sort_#t~mem5#1;havoc sort_#t~mem4#1;havoc sort_#t~mem5#1;call sort_#t~mem6#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem6#1;havoc sort_#t~mem6#1;call sort_#t~mem7#1 := read~int(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int(sort_#t~mem7#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem7#1;call write~int(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4); 1261#L551-2 sort_#t~post3#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post3#1;havoc sort_#t~post3#1; 1262#L551-3 [2022-11-02 20:55:17,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 2 times [2022-11-02 20:55:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:17,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754378726] [2022-11-02 20:55:17,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:17,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:17,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:17,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:17,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:17,867 INFO L85 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2022-11-02 20:55:17,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:17,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422302178] [2022-11-02 20:55:17,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:17,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:17,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:17,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:17,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 3 times [2022-11-02 20:55:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:17,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985209585] [2022-11-02 20:55:17,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:17,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:55:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:55:17,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:55:19,463 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:55:19,463 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:55:19,463 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:55:19,463 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:55:19,463 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:55:19,463 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:19,463 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:55:19,463 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:55:19,463 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration10_Lasso [2022-11-02 20:55:19,463 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:55:19,464 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:55:19,467 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:19,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:19,473 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:19,477 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:19,480 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:19,482 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:19,484 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:19,485 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:20,288 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:20,290 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:20,294 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:20,296 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:20,298 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:20,300 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:20,302 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:20,304 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:55:20,872 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:55:20,872 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:55:20,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:20,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:20,876 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:20,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-02 20:55:20,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:20,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:20,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:55:20,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:20,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:20,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:20,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:55:20,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:55:20,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:20,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-11-02 20:55:20,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:20,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:20,931 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:20,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-02 20:55:20,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:20,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:20,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:20,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:20,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:20,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:20,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:20,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:20,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-11-02 20:55:20,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:20,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:20,971 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:20,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-02 20:55:20,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:20,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:20,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:55:20,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:20,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:20,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:20,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:55:20,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:55:20,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:21,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:21,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:21,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:21,006 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:21,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-02 20:55:21,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:21,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:21,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:21,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:21,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:21,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:21,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:21,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:21,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-11-02 20:55:21,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:21,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:21,045 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:21,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-02 20:55:21,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:21,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:21,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:55:21,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:21,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:21,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:21,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:55:21,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:55:21,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:21,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:21,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:21,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:21,080 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:21,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-02 20:55:21,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:21,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:21,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:55:21,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:21,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:21,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:21,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:55:21,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:55:21,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:21,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-11-02 20:55:21,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:21,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:21,117 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:21,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-02 20:55:21,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:21,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:21,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:55:21,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:21,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:21,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:21,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:55:21,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:55:21,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:21,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:21,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:21,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:21,153 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:21,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-11-02 20:55:21,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:21,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:21,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:21,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:21,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:21,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:21,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:21,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:21,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-11-02 20:55:21,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:21,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:21,205 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:21,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-02 20:55:21,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:21,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:21,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:21,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:21,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:21,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:21,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:21,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:55:21,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:21,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:21,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:21,250 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:21,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-02 20:55:21,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:55:21,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:55:21,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:55:21,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:55:21,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:55:21,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:55:21,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-02 20:55:21,297 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:55:21,382 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-11-02 20:55:21,383 INFO L444 ModelExtractionUtils]: 13 out of 40 variables were initially zero. Simplification set additionally 23 variables to zero. [2022-11-02 20:55:21,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:55:21,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:21,384 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:21,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-02 20:55:21,386 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:55:21,397 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-11-02 20:55:21,397 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:55:21,397 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0#1, ULTIMATE.start_sort_~x#1.offset, v_rep(select #length ULTIMATE.start_sort_~x#1.base)_3) = -4*ULTIMATE.start_sort_~i~0#1 - 1*ULTIMATE.start_sort_~x#1.offset + 1*v_rep(select #length ULTIMATE.start_sort_~x#1.base)_3 Supporting invariants [] [2022-11-02 20:55:21,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:21,478 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-11-02 20:55:21,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:21,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:55:21,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:21,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:55:21,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:21,577 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-02 20:55:21,578 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:21,596 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 58 states and 78 transitions. Complement of second has 7 states. [2022-11-02 20:55:21,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-02 20:55:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-11-02 20:55:21,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 22 letters. Loop has 3 letters. [2022-11-02 20:55:21,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:21,598 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-02 20:55:21,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:21,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:55:21,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:21,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:55:21,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:21,695 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-02 20:55:21,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:21,724 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 58 states and 78 transitions. Complement of second has 7 states. [2022-11-02 20:55:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-02 20:55:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-11-02 20:55:21,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 22 letters. Loop has 3 letters. [2022-11-02 20:55:21,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:21,728 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-02 20:55:21,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:21,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:55:21,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:21,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:55:21,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:21,837 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-02 20:55:21,837 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:21,857 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 43 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 66 transitions. Complement of second has 6 states. [2022-11-02 20:55:21,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-02 20:55:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-11-02 20:55:21,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2022-11-02 20:55:21,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:21,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2022-11-02 20:55:21,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:21,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2022-11-02 20:55:21,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:55:21,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2022-11-02 20:55:21,861 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-02 20:55:21,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2022-11-02 20:55:21,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-11-02 20:55:21,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-11-02 20:55:21,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-11-02 20:55:21,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:21,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:55:21,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:55:21,862 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:55:21,862 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-02 20:55:21,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:55:21,863 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-02 20:55:21,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-11-02 20:55:21,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.11 08:55:21 BoogieIcfgContainer [2022-11-02 20:55:21,869 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-02 20:55:21,870 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:55:21,870 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:55:21,870 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:55:21,871 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:06" (3/4) ... [2022-11-02 20:55:21,873 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:55:21,873 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:55:21,874 INFO L158 Benchmark]: Toolchain (without parser) took 16445.01ms. Allocated memory was 148.9MB in the beginning and 213.9MB in the end (delta: 65.0MB). Free memory was 109.6MB in the beginning and 108.0MB in the end (delta: 1.6MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2022-11-02 20:55:21,874 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 148.9MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:55:21,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.20ms. Allocated memory is still 148.9MB. Free memory was 109.3MB in the beginning and 118.9MB in the end (delta: -9.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:55:21,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.04ms. Allocated memory is still 148.9MB. Free memory was 118.9MB in the beginning and 117.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:55:21,875 INFO L158 Benchmark]: Boogie Preprocessor took 39.02ms. Allocated memory is still 148.9MB. Free memory was 117.4MB in the beginning and 115.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:55:21,876 INFO L158 Benchmark]: RCFGBuilder took 393.73ms. Allocated memory is still 148.9MB. Free memory was 115.8MB in the beginning and 104.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:55:21,876 INFO L158 Benchmark]: BuchiAutomizer took 15429.45ms. Allocated memory was 148.9MB in the beginning and 213.9MB in the end (delta: 65.0MB). Free memory was 104.2MB in the beginning and 108.0MB in the end (delta: -3.7MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2022-11-02 20:55:21,876 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 213.9MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:55:21,878 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.28ms. Allocated memory is still 148.9MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.20ms. Allocated memory is still 148.9MB. Free memory was 109.3MB in the beginning and 118.9MB in the end (delta: -9.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.04ms. Allocated memory is still 148.9MB. Free memory was 118.9MB in the beginning and 117.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.02ms. Allocated memory is still 148.9MB. Free memory was 117.4MB in the beginning and 115.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 393.73ms. Allocated memory is still 148.9MB. Free memory was 115.8MB in the beginning and 104.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 15429.45ms. Allocated memory was 148.9MB in the beginning and 213.9MB in the end (delta: 65.0MB). Free memory was 104.2MB in the beginning and 108.0MB in the end (delta: -3.7MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 213.9MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[numbers] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * pass + n and consists of 3 locations. One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] and consists of 6 locations. One nondeterministic module has affine ranking function -1 * x + -4 * i + unknown-#length-unknown[x] and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.3s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 13.2s. Construction of modules took 0.4s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 289 mSDsluCounter, 408 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 273 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 481 IncrementalHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 135 mSDtfsCounter, 481 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU3 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital241 mio100 ax109 hnf100 lsp88 ukn68 mio100 lsp59 div149 bol100 ite100 ukn100 eq158 hnf93 smp76 dnf100 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-11-02 20:55:21,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:22,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-11-02 20:55:22,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-11-02 20:55:22,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-11-02 20:55:22,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:22,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d209d39f-13f1-4401-8e8f-9667d7d8ce78/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE