./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/eureka_05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/eureka_05.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 08:52:22,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 08:52:22,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 08:52:22,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 08:52:22,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 08:52:22,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 08:52:22,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 08:52:22,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 08:52:22,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 08:52:22,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 08:52:22,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 08:52:22,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 08:52:22,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 08:52:22,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 08:52:22,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 08:52:22,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 08:52:22,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 08:52:22,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 08:52:22,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 08:52:22,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 08:52:22,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 08:52:22,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 08:52:22,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 08:52:22,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 08:52:23,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 08:52:23,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 08:52:23,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 08:52:23,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 08:52:23,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 08:52:23,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 08:52:23,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 08:52:23,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 08:52:23,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 08:52:23,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 08:52:23,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 08:52:23,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 08:52:23,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 08:52:23,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 08:52:23,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 08:52:23,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 08:52:23,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 08:52:23,018 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-28 08:52:23,049 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 08:52:23,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 08:52:23,050 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 08:52:23,050 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 08:52:23,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 08:52:23,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 08:52:23,052 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 08:52:23,053 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-28 08:52:23,053 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-28 08:52:23,053 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-28 08:52:23,053 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-28 08:52:23,054 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-28 08:52:23,054 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-28 08:52:23,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 08:52:23,055 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 08:52:23,055 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 08:52:23,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 08:52:23,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 08:52:23,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 08:52:23,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-28 08:52:23,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-28 08:52:23,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-28 08:52:23,057 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 08:52:23,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 08:52:23,058 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-28 08:52:23,058 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 08:52:23,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-28 08:52:23,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 08:52:23,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 08:52:23,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 08:52:23,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 08:52:23,060 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 08:52:23,061 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-28 08:52:23,062 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_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f12ca1e314a03dfb1c8beadd0c1a180c2d2339dd5f3109d5999df06d52395ab [2021-10-28 08:52:23,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 08:52:23,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 08:52:23,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 08:52:23,433 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 08:52:23,434 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 08:52:23,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/loops/eureka_05.i [2021-10-28 08:52:23,519 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/data/99452f7d9/9c017e5a2d3d4b208d226bc6d7bad387/FLAG57530142f [2021-10-28 08:52:24,075 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 08:52:24,076 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/sv-benchmarks/c/loops/eureka_05.i [2021-10-28 08:52:24,084 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/data/99452f7d9/9c017e5a2d3d4b208d226bc6d7bad387/FLAG57530142f [2021-10-28 08:52:24,420 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/data/99452f7d9/9c017e5a2d3d4b208d226bc6d7bad387 [2021-10-28 08:52:24,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 08:52:24,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 08:52:24,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 08:52:24,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 08:52:24,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 08:52:24,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:52:24" (1/1) ... [2021-10-28 08:52:24,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74c4cf3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:52:24, skipping insertion in model container [2021-10-28 08:52:24,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:52:24" (1/1) ... [2021-10-28 08:52:24,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 08:52:24,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 08:52:24,707 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/sv-benchmarks/c/loops/eureka_05.i[810,823] [2021-10-28 08:52:24,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:52:24,796 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 08:52:24,824 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/sv-benchmarks/c/loops/eureka_05.i[810,823] [2021-10-28 08:52:24,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:52:24,875 INFO L208 MainTranslator]: Completed translation [2021-10-28 08:52:24,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:52:24 WrapperNode [2021-10-28 08:52:24,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 08:52:24,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 08:52:24,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 08:52:24,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 08:52:24,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:52:24" (1/1) ... [2021-10-28 08:52:24,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:52:24" (1/1) ... [2021-10-28 08:52:24,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 08:52:24,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 08:52:24,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 08:52:24,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 08:52:24,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:52:24" (1/1) ... [2021-10-28 08:52:24,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:52:24" (1/1) ... [2021-10-28 08:52:24,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:52:24" (1/1) ... [2021-10-28 08:52:24,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:52:24" (1/1) ... [2021-10-28 08:52:24,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:52:24" (1/1) ... [2021-10-28 08:52:24,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:52:24" (1/1) ... [2021-10-28 08:52:25,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:52:24" (1/1) ... [2021-10-28 08:52:25,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 08:52:25,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 08:52:25,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 08:52:25,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 08:52:25,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:52:24" (1/1) ... [2021-10-28 08:52:25,026 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:52:25,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:25,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:52:25,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-28 08:52:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 08:52:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 08:52:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 08:52:25,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 08:52:25,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 08:52:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 08:52:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 08:52:25,475 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 08:52:25,475 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-10-28 08:52:25,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:52:25 BoogieIcfgContainer [2021-10-28 08:52:25,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 08:52:25,480 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-28 08:52:25,480 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-28 08:52:25,500 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-28 08:52:25,501 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 08:52:25,502 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.10 08:52:24" (1/3) ... [2021-10-28 08:52:25,504 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38f7d8b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 08:52:25, skipping insertion in model container [2021-10-28 08:52:25,504 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 08:52:25,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:52:24" (2/3) ... [2021-10-28 08:52:25,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38f7d8b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 08:52:25, skipping insertion in model container [2021-10-28 08:52:25,505 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-28 08:52:25,505 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:52:25" (3/3) ... [2021-10-28 08:52:25,507 INFO L389 chiAutomizerObserver]: Analyzing ICFG eureka_05.i [2021-10-28 08:52:25,590 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-28 08:52:25,590 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-28 08:52:25,590 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-28 08:52:25,591 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-28 08:52:25,591 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-28 08:52:25,591 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-28 08:52:25,591 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-28 08:52:25,591 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-28 08:52:25,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:52:25,639 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-10-28 08:52:25,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:52:25,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:52:25,647 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 08:52:25,647 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-28 08:52:25,647 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-28 08:52:25,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:52:25,652 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-10-28 08:52:25,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:52:25,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:52:25,653 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-28 08:52:25,653 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-10-28 08:52:25,662 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 14#L-1true havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 7#L44-3true [2021-10-28 08:52:25,662 INFO L793 eck$LassoCheckResult]: Loop: 7#L44-3true assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 19#L44-2true main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 7#L44-3true [2021-10-28 08:52:25,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:25,672 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-28 08:52:25,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:25,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437756172] [2021-10-28 08:52:25,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:25,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:25,819 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:52:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:25,879 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:52:25,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-10-28 08:52:25,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:25,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183362886] [2021-10-28 08:52:25,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:25,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:25,901 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:52:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:25,917 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:52:25,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-10-28 08:52:25,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:25,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216582012] [2021-10-28 08:52:25,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:25,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:25,963 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:52:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:26,010 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:52:27,139 INFO L210 LassoAnalysis]: Preferences: [2021-10-28 08:52:27,139 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-28 08:52:27,140 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-28 08:52:27,140 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-28 08:52:27,140 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-28 08:52:27,141 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:52:27,141 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-28 08:52:27,166 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-28 08:52:27,166 INFO L133 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration1_Lasso [2021-10-28 08:52:27,166 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-28 08:52:27,166 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-28 08:52:27,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:52:27,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:52:27,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:52:27,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:52:27,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:52:27,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:52:27,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:52:27,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:52:27,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-28 08:52:28,322 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-28 08:52:28,329 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-28 08:52:28,331 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:52:28,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:28,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:52:28,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:52:28,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-10-28 08:52:28,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:52:28,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 08:52:28,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:52:28,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:52:28,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:52:28,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 08:52:28,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 08:52:28,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:52:28,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-10-28 08:52:28,419 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:52:28,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:28,422 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:52:28,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-10-28 08:52:28,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:52:28,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:52:28,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 08:52:28,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:52:28,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:52:28,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:52:28,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 08:52:28,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 08:52:28,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:52:28,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-10-28 08:52:28,504 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:52:28,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:28,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:52:28,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:52:28,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:52:28,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:52:28,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:52:28,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:52:28,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 08:52:28,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 08:52:28,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-10-28 08:52:28,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:52:28,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-10-28 08:52:28,602 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:52:28,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:28,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:52:28,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:52:28,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:52:28,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-28 08:52:28,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:52:28,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:52:28,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:52:28,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-28 08:52:28,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-28 08:52:28,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-10-28 08:52:28,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:52:28,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-10-28 08:52:28,675 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:52:28,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:28,676 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:52:28,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-10-28 08:52:28,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:52:28,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:52:28,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:52:28,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:52:28,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:52:28,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 08:52:28,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 08:52:28,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:52:28,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-10-28 08:52:28,752 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:52:28,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:28,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:52:28,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:52:28,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:52:28,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:52:28,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:52:28,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:52:28,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 08:52:28,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 08:52:28,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-10-28 08:52:28,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-28 08:52:28,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-10-28 08:52:28,842 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:52:28,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:28,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:52:28,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-10-28 08:52:28,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-28 08:52:28,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-28 08:52:28,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-28 08:52:28,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-28 08:52:28,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-28 08:52:28,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-28 08:52:28,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-28 08:52:28,902 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-28 08:52:28,978 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-10-28 08:52:28,978 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-10-28 08:52:28,981 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-28 08:52:28,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:28,985 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-28 08:52:29,013 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-28 08:52:29,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-10-28 08:52:29,035 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-28 08:52:29,036 INFO L513 LassoAnalysis]: Proved termination. [2021-10-28 08:52:29,037 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#array~1.base)_1) = 8*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~#array~1.base)_1 Supporting invariants [] [2021-10-28 08:52:29,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2021-10-28 08:52:29,336 INFO L297 tatePredicateManager]: 31 out of 31 supporting invariants were superfluous and have been removed [2021-10-28 08:52:29,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-10-28 08:52:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:52:29,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-28 08:52:29,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:52:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:52:29,424 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-28 08:52:29,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:52:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:52:29,492 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-10-28 08:52:29,494 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:52:29,562 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 48 states and 71 transitions. Complement of second has 8 states. [2021-10-28 08:52:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-10-28 08:52:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:52:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2021-10-28 08:52:29,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 2 letters. Loop has 2 letters. [2021-10-28 08:52:29,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 08:52:29,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 4 letters. Loop has 2 letters. [2021-10-28 08:52:29,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 08:52:29,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 2 letters. Loop has 4 letters. [2021-10-28 08:52:29,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-28 08:52:29,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 71 transitions. [2021-10-28 08:52:29,575 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-10-28 08:52:29,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 18 states and 24 transitions. [2021-10-28 08:52:29,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-10-28 08:52:29,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-10-28 08:52:29,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2021-10-28 08:52:29,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:52:29,583 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-10-28 08:52:29,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2021-10-28 08:52:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-10-28 08:52:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:52:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2021-10-28 08:52:29,613 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-10-28 08:52:29,613 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-10-28 08:52:29,613 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-28 08:52:29,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2021-10-28 08:52:29,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-10-28 08:52:29,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:52:29,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:52:29,615 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-10-28 08:52:29,615 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-28 08:52:29,616 INFO L791 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 238#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 239#L44-3 assume !(main_~i~1 >= 0); 240#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 236#L30-3 [2021-10-28 08:52:29,616 INFO L793 eck$LassoCheckResult]: Loop: 236#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 249#L32-3 assume !(SelectionSort_~i~0 < ~n~0); 250#L32-4 call SelectionSort_#t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem7;havoc SelectionSort_#t~mem7;call SelectionSort_#t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem8, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem8;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 235#L30-2 SelectionSort_#t~post3 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post3;havoc SelectionSort_#t~post3; 236#L30-3 [2021-10-28 08:52:29,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:29,617 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-10-28 08:52:29,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:29,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838609534] [2021-10-28 08:52:29,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:29,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:52:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:52:29,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:52:29,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838609534] [2021-10-28 08:52:29,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838609534] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:52:29,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:52:29,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 08:52:29,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509145534] [2021-10-28 08:52:29,715 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 08:52:29,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:29,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 1 times [2021-10-28 08:52:29,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:29,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448936625] [2021-10-28 08:52:29,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:29,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:29,740 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:52:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:29,768 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:52:29,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:52:29,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:52:29,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:52:29,938 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:52:29,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:52:29,971 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2021-10-28 08:52:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:52:29,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2021-10-28 08:52:29,977 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:52:29,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 22 transitions. [2021-10-28 08:52:29,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-10-28 08:52:29,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-10-28 08:52:29,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2021-10-28 08:52:29,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:52:29,981 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-10-28 08:52:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2021-10-28 08:52:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-10-28 08:52:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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) [2021-10-28 08:52:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-28 08:52:29,989 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-28 08:52:29,989 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-28 08:52:29,989 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-28 08:52:29,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2021-10-28 08:52:29,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:52:29,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:52:29,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:52:29,991 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-10-28 08:52:29,992 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-28 08:52:29,992 INFO L791 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 279#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 280#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 281#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 282#L44-3 assume !(main_~i~1 >= 0); 283#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 277#L30-3 [2021-10-28 08:52:29,992 INFO L793 eck$LassoCheckResult]: Loop: 277#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 291#L32-3 assume !(SelectionSort_~i~0 < ~n~0); 292#L32-4 call SelectionSort_#t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem7;havoc SelectionSort_#t~mem7;call SelectionSort_#t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem8, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem8;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 276#L30-2 SelectionSort_#t~post3 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post3;havoc SelectionSort_#t~post3; 277#L30-3 [2021-10-28 08:52:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:29,994 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-10-28 08:52:29,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:29,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005648164] [2021-10-28 08:52:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:29,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:52:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:52:30,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:52:30,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005648164] [2021-10-28 08:52:30,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005648164] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:52:30,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809716834] [2021-10-28 08:52:30,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:30,087 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:52:30,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:30,088 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:52:30,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-28 08:52:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:52:30,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-28 08:52:30,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:52:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:52:30,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809716834] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:52:30,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 08:52:30,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-10-28 08:52:30,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571935437] [2021-10-28 08:52:30,179 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 08:52:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 2 times [2021-10-28 08:52:30,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:30,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143410586] [2021-10-28 08:52:30,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:30,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:30,202 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:52:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:30,226 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:52:30,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:52:30,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 08:52:30,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-28 08:52:30,380 INFO L87 Difference]: Start difference. First operand 17 states and 21 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) [2021-10-28 08:52:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:52:30,416 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-10-28 08:52:30,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 08:52:30,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2021-10-28 08:52:30,421 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:52:30,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2021-10-28 08:52:30,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-10-28 08:52:30,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-10-28 08:52:30,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2021-10-28 08:52:30,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:52:30,423 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-10-28 08:52:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2021-10-28 08:52:30,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-10-28 08:52:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:52:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-10-28 08:52:30,428 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-10-28 08:52:30,428 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-10-28 08:52:30,429 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-28 08:52:30,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2021-10-28 08:52:30,431 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:52:30,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:52:30,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:52:30,433 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2021-10-28 08:52:30,433 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-28 08:52:30,433 INFO L791 eck$LassoCheckResult]: Stem: 337#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 338#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 339#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 340#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 341#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 342#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 353#L44-3 assume !(main_~i~1 >= 0); 343#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 336#L30-3 [2021-10-28 08:52:30,434 INFO L793 eck$LassoCheckResult]: Loop: 336#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 351#L32-3 assume !(SelectionSort_~i~0 < ~n~0); 352#L32-4 call SelectionSort_#t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem7;havoc SelectionSort_#t~mem7;call SelectionSort_#t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem8, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem8;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 335#L30-2 SelectionSort_#t~post3 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post3;havoc SelectionSort_#t~post3; 336#L30-3 [2021-10-28 08:52:30,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:30,434 INFO L85 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2021-10-28 08:52:30,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:30,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536937712] [2021-10-28 08:52:30,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:30,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:52:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:52:30,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:52:30,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536937712] [2021-10-28 08:52:30,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536937712] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:52:30,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993750268] [2021-10-28 08:52:30,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-28 08:52:30,538 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:52:30,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:30,550 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:52:30,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-28 08:52:30,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-28 08:52:30,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 08:52:30,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-28 08:52:30,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:52:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:52:30,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993750268] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:52:30,658 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 08:52:30,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-10-28 08:52:30,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617002827] [2021-10-28 08:52:30,660 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 08:52:30,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 3 times [2021-10-28 08:52:30,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:30,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233042571] [2021-10-28 08:52:30,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:30,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:30,679 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:52:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:30,702 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:52:30,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:52:30,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 08:52:30,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-28 08:52:30,871 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:52:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:52:30,911 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-10-28 08:52:30,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 08:52:30,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2021-10-28 08:52:30,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:52:30,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2021-10-28 08:52:30,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-10-28 08:52:30,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-10-28 08:52:30,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2021-10-28 08:52:30,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:52:30,917 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-10-28 08:52:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2021-10-28 08:52:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-10-28 08:52:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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) [2021-10-28 08:52:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-10-28 08:52:30,926 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-10-28 08:52:30,926 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-10-28 08:52:30,926 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-28 08:52:30,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2021-10-28 08:52:30,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:52:30,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:52:30,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:52:30,929 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2021-10-28 08:52:30,929 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-28 08:52:30,929 INFO L791 eck$LassoCheckResult]: Stem: 407#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 408#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 409#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 410#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 411#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 412#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 423#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 425#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 424#L44-3 assume !(main_~i~1 >= 0); 413#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 406#L30-3 [2021-10-28 08:52:30,930 INFO L793 eck$LassoCheckResult]: Loop: 406#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 421#L32-3 assume !(SelectionSort_~i~0 < ~n~0); 422#L32-4 call SelectionSort_#t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem7;havoc SelectionSort_#t~mem7;call SelectionSort_#t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem8, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem8;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 405#L30-2 SelectionSort_#t~post3 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post3;havoc SelectionSort_#t~post3; 406#L30-3 [2021-10-28 08:52:30,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:30,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2021-10-28 08:52:30,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:30,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993994041] [2021-10-28 08:52:30,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:30,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:52:31,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:52:31,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:52:31,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993994041] [2021-10-28 08:52:31,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993994041] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:52:31,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688734893] [2021-10-28 08:52:31,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-28 08:52:31,023 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:52:31,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:31,029 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:52:31,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-28 08:52:31,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-10-28 08:52:31,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 08:52:31,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-28 08:52:31,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:52:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:52:31,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688734893] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:52:31,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 08:52:31,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-10-28 08:52:31,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549086533] [2021-10-28 08:52:31,173 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 08:52:31,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 4 times [2021-10-28 08:52:31,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:31,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331449334] [2021-10-28 08:52:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:31,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:31,190 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:52:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:31,216 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:52:31,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:52:31,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:52:31,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:52:31,363 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:52:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:52:31,400 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-10-28 08:52:31,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 08:52:31,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2021-10-28 08:52:31,405 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:52:31,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2021-10-28 08:52:31,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-10-28 08:52:31,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-10-28 08:52:31,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2021-10-28 08:52:31,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:52:31,406 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-10-28 08:52:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2021-10-28 08:52:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2021-10-28 08:52:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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) [2021-10-28 08:52:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-10-28 08:52:31,410 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-10-28 08:52:31,410 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-10-28 08:52:31,410 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-28 08:52:31,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2021-10-28 08:52:31,411 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:52:31,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:52:31,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:52:31,412 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-10-28 08:52:31,412 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-28 08:52:31,412 INFO L791 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 489#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 490#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 491#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 492#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 493#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 504#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 508#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 507#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 506#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 505#L44-3 assume !(main_~i~1 >= 0); 494#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 487#L30-3 [2021-10-28 08:52:31,412 INFO L793 eck$LassoCheckResult]: Loop: 487#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 502#L32-3 assume !(SelectionSort_~i~0 < ~n~0); 503#L32-4 call SelectionSort_#t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem7;havoc SelectionSort_#t~mem7;call SelectionSort_#t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem8, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem8;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 486#L30-2 SelectionSort_#t~post3 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post3;havoc SelectionSort_#t~post3; 487#L30-3 [2021-10-28 08:52:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2021-10-28 08:52:31,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:31,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388926819] [2021-10-28 08:52:31,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:31,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:52:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:52:31,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:52:31,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388926819] [2021-10-28 08:52:31,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388926819] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:52:31,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323073464] [2021-10-28 08:52:31,523 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-28 08:52:31,524 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:52:31,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:31,530 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:52:31,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-28 08:52:31,613 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-28 08:52:31,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 08:52:31,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-28 08:52:31,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:52:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:52:31,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323073464] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:52:31,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 08:52:31,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-10-28 08:52:31,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115768023] [2021-10-28 08:52:31,674 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-28 08:52:31,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:31,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 5 times [2021-10-28 08:52:31,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:31,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192305461] [2021-10-28 08:52:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:31,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:31,688 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:52:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:31,705 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:52:31,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:52:31,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 08:52:31,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-10-28 08:52:31,851 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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) [2021-10-28 08:52:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:52:31,914 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2021-10-28 08:52:31,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 08:52:31,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2021-10-28 08:52:31,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:52:31,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 45 transitions. [2021-10-28 08:52:31,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-10-28 08:52:31,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-10-28 08:52:31,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 45 transitions. [2021-10-28 08:52:31,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:52:31,918 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2021-10-28 08:52:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 45 transitions. [2021-10-28 08:52:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2021-10-28 08:52:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:52:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-10-28 08:52:31,921 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-10-28 08:52:31,921 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-10-28 08:52:31,921 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-28 08:52:31,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2021-10-28 08:52:31,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:52:31,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:52:31,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:52:31,922 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-10-28 08:52:31,922 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-28 08:52:31,923 INFO L791 eck$LassoCheckResult]: Stem: 595#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 596#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 597#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 598#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 599#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 600#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 617#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 616#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 615#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 614#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 613#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 612#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 611#L44-3 assume !(main_~i~1 >= 0); 601#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 594#L30-3 [2021-10-28 08:52:31,923 INFO L793 eck$LassoCheckResult]: Loop: 594#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 609#L32-3 assume !(SelectionSort_~i~0 < ~n~0); 610#L32-4 call SelectionSort_#t~mem7 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem7;havoc SelectionSort_#t~mem7;call SelectionSort_#t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4);call write~int(SelectionSort_#t~mem8, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~lh~0, 4);havoc SelectionSort_#t~mem8;call write~int(SelectionSort_~temp~0, ~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 593#L30-2 SelectionSort_#t~post3 := SelectionSort_~lh~0;SelectionSort_~lh~0 := 1 + SelectionSort_#t~post3;havoc SelectionSort_#t~post3; 594#L30-3 [2021-10-28 08:52:31,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:31,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2021-10-28 08:52:31,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:31,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554120922] [2021-10-28 08:52:31,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:31,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:31,940 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:52:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:31,963 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:52:31,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:31,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 6 times [2021-10-28 08:52:31,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:31,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192512868] [2021-10-28 08:52:31,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:31,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:31,971 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:52:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:31,979 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:52:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash -743535747, now seen corresponding path program 1 times [2021-10-28 08:52:31,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:31,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085524973] [2021-10-28 08:52:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:31,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:52:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-28 08:52:32,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:52:32,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085524973] [2021-10-28 08:52:32,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085524973] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:52:32,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:52:32,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 08:52:32,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140552480] [2021-10-28 08:52:32,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:52:32,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 08:52:32,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-28 08:52:32,182 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:52:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:52:32,236 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2021-10-28 08:52:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 08:52:32,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2021-10-28 08:52:32,238 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-10-28 08:52:32,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions. [2021-10-28 08:52:32,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-10-28 08:52:32,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-10-28 08:52:32,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2021-10-28 08:52:32,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:52:32,239 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-10-28 08:52:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2021-10-28 08:52:32,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2021-10-28 08:52:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:52:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-10-28 08:52:32,243 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-10-28 08:52:32,243 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-10-28 08:52:32,243 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-28 08:52:32,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2021-10-28 08:52:32,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:52:32,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:52:32,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:52:32,245 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2021-10-28 08:52:32,245 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-28 08:52:32,245 INFO L791 eck$LassoCheckResult]: Stem: 666#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 667#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 668#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 669#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 670#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 671#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 690#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 689#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 688#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 687#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 686#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 685#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 684#L44-3 assume !(main_~i~1 >= 0); 672#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 673#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 682#L32-3 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem6 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 678#L33 [2021-10-28 08:52:32,245 INFO L793 eck$LassoCheckResult]: Loop: 678#L33 assume SelectionSort_#t~mem5 < SelectionSort_#t~mem6;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem6;SelectionSort_~rh~0 := SelectionSort_~i~0; 679#L32-2 SelectionSort_#t~post4 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post4;havoc SelectionSort_#t~post4; 681#L32-3 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem6 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 678#L33 [2021-10-28 08:52:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:32,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425501, now seen corresponding path program 1 times [2021-10-28 08:52:32,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:32,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026199491] [2021-10-28 08:52:32,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:32,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:32,277 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:52:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:32,323 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:52:32,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:32,326 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 1 times [2021-10-28 08:52:32,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:32,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142804502] [2021-10-28 08:52:32,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:32,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:32,332 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:52:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:52:32,349 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:52:32,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:52:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1574719937, now seen corresponding path program 1 times [2021-10-28 08:52:32,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:52:32,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929697942] [2021-10-28 08:52:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:32,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:52:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:52:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-28 08:52:32,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:52:32,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929697942] [2021-10-28 08:52:32,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929697942] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:52:32,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82020825] [2021-10-28 08:52:32,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:52:32,959 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:52:32,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:52:32,961 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:52:32,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-28 08:52:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:52:33,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-28 08:52:33,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:52:33,200 INFO L354 Elim1Store]: treesize reduction 83, result has 23.9 percent of original size [2021-10-28 08:52:33,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 31 [2021-10-28 08:52:33,557 INFO L354 Elim1Store]: treesize reduction 44, result has 45.7 percent of original size [2021-10-28 08:52:33,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 62 [2021-10-28 08:52:33,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:52:33,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-10-28 08:52:33,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:52:33,866 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-28 08:52:33,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2021-10-28 08:52:34,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:52:34,019 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-28 08:52:34,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2021-10-28 08:52:34,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:52:34,136 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-28 08:52:34,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2021-10-28 08:52:34,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:52:34,284 INFO L354 Elim1Store]: treesize reduction 140, result has 16.7 percent of original size [2021-10-28 08:52:34,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 52 [2021-10-28 08:54:22,499 WARN L207 SmtUtils]: Spent 12.05 s on a formula simplification that was a NOOP. DAG size: 30 [2021-10-28 08:54:46,791 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 32 [2021-10-28 08:55:10,944 WARN L207 SmtUtils]: Spent 12.03 s on a formula simplification that was a NOOP. DAG size: 35 [2021-10-28 08:55:10,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-28 08:55:10,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:55:11,002 INFO L354 Elim1Store]: treesize reduction 117, result has 2.5 percent of original size [2021-10-28 08:55:11,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 26 [2021-10-28 08:55:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-28 08:55:11,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82020825] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:55:11,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 08:55:11,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-10-28 08:55:11,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134409371] [2021-10-28 08:55:11,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:55:11,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-28 08:55:11,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=189, Unknown=10, NotChecked=0, Total=240 [2021-10-28 08:55:11,180 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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) [2021-10-28 08:55:35,285 WARN L207 SmtUtils]: Spent 24.05 s on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-10-28 08:56:59,785 WARN L207 SmtUtils]: Spent 12.10 s on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2021-10-28 08:57:15,807 WARN L207 SmtUtils]: Spent 16.00 s on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2021-10-28 08:57:22,812 WARN L207 SmtUtils]: Spent 6.99 s on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2021-10-28 08:58:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:58:35,058 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-10-28 08:58:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 08:58:35,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2021-10-28 08:58:35,060 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-10-28 08:58:35,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2021-10-28 08:58:35,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-10-28 08:58:35,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-10-28 08:58:35,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2021-10-28 08:58:35,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:58:35,061 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2021-10-28 08:58:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2021-10-28 08:58:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-10-28 08:58:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:58:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-10-28 08:58:35,064 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-10-28 08:58:35,064 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-10-28 08:58:35,064 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-28 08:58:35,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2021-10-28 08:58:35,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-10-28 08:58:35,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-28 08:58:35,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-28 08:58:35,066 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:58:35,066 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-28 08:58:35,066 INFO L791 eck$LassoCheckResult]: Stem: 817#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(12);call ~#array~0.base, ~#array~0.offset := #Ultimate.allocOnStack(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; 818#L-1 havoc main_#res;havoc main_#t~post9, main_#t~mem11, main_#t~post10, main_~#array~1.base, main_~#array~1.offset, main_~i~1;call main_~#array~1.base, main_~#array~1.offset := #Ultimate.allocOnStack(20);havoc main_~i~1;main_~i~1 := 4; 819#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 820#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 821#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 822#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 834#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 841#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 840#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 839#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 838#L44-3 assume !!(main_~i~1 >= 0);call write~int(main_~i~1, main_~#array~1.base, main_~#array~1.offset + 4 * main_~i~1, 4); 837#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 836#L44-3 assume !(main_~i~1 >= 0); 823#L44-4 havoc SelectionSort_#t~mem5, SelectionSort_#t~mem6, SelectionSort_#t~post4, SelectionSort_#t~mem7, SelectionSort_#t~mem8, SelectionSort_#t~post3, SelectionSort_~lh~0, SelectionSort_~rh~0, SelectionSort_~i~0, SelectionSort_~temp~0;havoc SelectionSort_~lh~0;havoc SelectionSort_~rh~0;havoc SelectionSort_~i~0;havoc SelectionSort_~temp~0;SelectionSort_~lh~0 := 0; 824#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 833#L32-3 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem6 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 829#L33 assume !(SelectionSort_#t~mem5 < SelectionSort_#t~mem6);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem6; 830#L32-2 [2021-10-28 08:58:35,067 INFO L793 eck$LassoCheckResult]: Loop: 830#L32-2 SelectionSort_#t~post4 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post4;havoc SelectionSort_#t~post4; 832#L32-3 assume !!(SelectionSort_~i~0 < ~n~0);call SelectionSort_#t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~i~0, 4);call SelectionSort_#t~mem6 := read~int(~#array~0.base, ~#array~0.offset + 4 * SelectionSort_~rh~0, 4); 842#L33 assume SelectionSort_#t~mem5 < SelectionSort_#t~mem6;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem6;SelectionSort_~rh~0 := SelectionSort_~i~0; 830#L32-2 [2021-10-28 08:58:35,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:58:35,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1638583016, now seen corresponding path program 1 times [2021-10-28 08:58:35,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:58:35,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427616965] [2021-10-28 08:58:35,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:58:35,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:58:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:58:35,083 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:58:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:58:35,100 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:58:35,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:58:35,101 INFO L85 PathProgramCache]: Analyzing trace with hash 68297, now seen corresponding path program 2 times [2021-10-28 08:58:35,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:58:35,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666342578] [2021-10-28 08:58:35,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:58:35,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:58:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:58:35,107 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:58:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:58:35,113 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:58:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:58:35,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1571618174, now seen corresponding path program 1 times [2021-10-28 08:58:35,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:58:35,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936822893] [2021-10-28 08:58:35,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:58:35,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:58:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:58:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-28 08:58:35,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:58:35,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936822893] [2021-10-28 08:58:35,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936822893] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:58:35,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144772313] [2021-10-28 08:58:35,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:58:35,532 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 08:58:35,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:58:35,536 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 08:58:35,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-10-28 08:58:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:58:35,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-28 08:58:35,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:58:35,749 INFO L354 Elim1Store]: treesize reduction 83, result has 23.9 percent of original size [2021-10-28 08:58:35,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 31 [2021-10-28 08:58:36,036 INFO L354 Elim1Store]: treesize reduction 44, result has 45.7 percent of original size [2021-10-28 08:58:36,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 62 [2021-10-28 08:58:36,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:58:36,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-10-28 08:58:36,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:58:36,298 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-28 08:58:36,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2021-10-28 08:58:36,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:58:36,408 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-28 08:58:36,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2021-10-28 08:58:36,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:58:36,515 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-10-28 08:58:36,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2021-10-28 08:58:36,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-28 08:58:36,648 INFO L354 Elim1Store]: treesize reduction 140, result has 16.7 percent of original size [2021-10-28 08:58:36,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 52 [2021-10-28 08:59:12,770 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 31 [2021-10-28 08:59:25,023 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 33 [2021-10-28 08:59:37,161 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 36 [2021-10-28 08:59:49,438 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 36 [2021-10-28 08:59:49,475 INFO L354 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2021-10-28 08:59:49,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 23 [2021-10-28 08:59:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-28 08:59:49,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144772313] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 08:59:49,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 08:59:49,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2021-10-28 08:59:49,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130479286] [2021-10-28 08:59:49,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:59:49,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-28 08:59:49,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=295, Unknown=2, NotChecked=0, Total=342 [2021-10-28 08:59:49,615 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:00:13,720 WARN L207 SmtUtils]: Spent 24.06 s on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2021-10-28 09:01:38,062 WARN L207 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2021-10-28 09:02:02,218 WARN L207 SmtUtils]: Spent 24.12 s on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2021-10-28 09:02:26,353 WARN L207 SmtUtils]: Spent 24.11 s on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2021-10-28 09:02:27,297 WARN L228 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-10-28 09:02:27,298 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:241) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:260) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:676) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:61) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:63) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:950) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:530) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:237) ... 39 more [2021-10-28 09:02:27,304 INFO L168 Benchmark]: Toolchain (without parser) took 602877.80 ms. Allocated memory was 130.0 MB in the beginning and 163.6 MB in the end (delta: 33.6 MB). Free memory was 94.1 MB in the beginning and 47.1 MB in the end (delta: 47.0 MB). Peak memory consumption was 79.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:02:27,304 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 130.0 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:02:27,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.09 ms. Allocated memory is still 130.0 MB. Free memory was 93.9 MB in the beginning and 106.2 MB in the end (delta: -12.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:02:27,305 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.43 ms. Allocated memory is still 130.0 MB. Free memory was 106.2 MB in the beginning and 104.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:02:27,306 INFO L168 Benchmark]: Boogie Preprocessor took 71.29 ms. Allocated memory is still 130.0 MB. Free memory was 104.7 MB in the beginning and 103.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:02:27,306 INFO L168 Benchmark]: RCFGBuilder took 466.17 ms. Allocated memory is still 130.0 MB. Free memory was 103.2 MB in the beginning and 92.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:02:27,307 INFO L168 Benchmark]: BuchiAutomizer took 601823.56 ms. Allocated memory was 130.0 MB in the beginning and 163.6 MB in the end (delta: 33.6 MB). Free memory was 92.1 MB in the beginning and 47.1 MB in the end (delta: 45.0 MB). Peak memory consumption was 80.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:02:27,309 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2021-10-28 09:02:27,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 101 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 130.0 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 448.09 ms. Allocated memory is still 130.0 MB. Free memory was 93.9 MB in the beginning and 106.2 MB in the end (delta: -12.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 61.43 ms. Allocated memory is still 130.0 MB. Free memory was 106.2 MB in the beginning and 104.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.29 ms. Allocated memory is still 130.0 MB. Free memory was 104.7 MB in the beginning and 103.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 466.17 ms. Allocated memory is still 130.0 MB. Free memory was 103.2 MB in the beginning and 92.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 601823.56 ms. Allocated memory was 130.0 MB in the beginning and 163.6 MB in the end (delta: 33.6 MB). Free memory was 92.1 MB in the beginning and 47.1 MB in the end (delta: 45.0 MB). Peak memory consumption was 80.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:241) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-28 09:02:27,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-10-28 09:02:27,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-10-28 09:02:27,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-28 09:02:27,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-10-28 09:02:28,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-28 09:02:28,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_821aa671-bc94-463e-8167-368d4fc00538/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 Received shutdown request...