./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_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/eureka_05.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD --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_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/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_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/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 23:32:21,965 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-10-28 23:32:21,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-28 23:32:22,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-28 23:32:22,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-28 23:32:22,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-28 23:32:22,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-28 23:32:22,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-28 23:32:22,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-28 23:32:22,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-28 23:32:22,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-10-28 23:32:22,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-28 23:32:22,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-28 23:32:22,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-28 23:32:22,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-28 23:32:22,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-28 23:32:22,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-28 23:32:22,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-28 23:32:22,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-28 23:32:22,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-28 23:32:22,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-28 23:32:22,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-28 23:32:22,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-10-28 23:32:22,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-28 23:32:22,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-28 23:32:22,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-28 23:32:22,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-28 23:32:22,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-28 23:32:22,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-28 23:32:22,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-28 23:32:22,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-28 23:32:22,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-28 23:32:22,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-28 23:32:22,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-28 23:32:22,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-28 23:32:22,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-28 23:32:22,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-28 23:32:22,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-28 23:32:22,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-28 23:32:22,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-28 23:32:22,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-10-28 23:32:22,118 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/config/svcomp-Termination-32bit-Automizer_Default.epf
[2021-10-28 23:32:22,150 INFO L113 SettingsManager]: Loading preferences was successful
[2021-10-28 23:32:22,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-28 23:32:22,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-10-28 23:32:22,151 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-10-28 23:32:22,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-28 23:32:22,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-10-28 23:32:22,153 INFO L138 SettingsManager]: * Use SBE=true
[2021-10-28 23:32:22,154 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2021-10-28 23:32:22,154 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2021-10-28 23:32:22,154 INFO L138 SettingsManager]: * Use old map elimination=false
[2021-10-28 23:32:22,154 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false
[2021-10-28 23:32:22,155 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true
[2021-10-28 23:32:22,155 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2021-10-28 23:32:22,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-28 23:32:22,155 INFO L138 SettingsManager]: * sizeof long=4
[2021-10-28 23:32:22,156 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2021-10-28 23:32:22,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-10-28 23:32:22,156 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-10-28 23:32:22,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-10-28 23:32:22,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2021-10-28 23:32:22,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2021-10-28 23:32:22,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2021-10-28 23:32:22,157 INFO L138 SettingsManager]: * sizeof long double=12
[2021-10-28 23:32:22,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-10-28 23:32:22,158 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false
[2021-10-28 23:32:22,158 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-10-28 23:32:22,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2021-10-28 23:32:22,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-28 23:32:22,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-10-28 23:32:22,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-28 23:32:22,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-10-28 23:32:22,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-10-28 23:32:22,161 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2021-10-28 23:32:22,161 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_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/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_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD
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 23:32:22,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-28 23:32:22,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-28 23:32:22,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-28 23:32:22,519 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-10-28 23:32:22,520 INFO L275 PluginConnector]: CDTParser initialized
[2021-10-28 23:32:22,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/loops/eureka_05.i
[2021-10-28 23:32:22,610 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/data/8404dff81/2596ab4aa92b4828bc487d3efdbc130e/FLAG78bf77686
[2021-10-28 23:32:23,178 INFO L306 CDTParser]: Found 1 translation units.
[2021-10-28 23:32:23,179 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/sv-benchmarks/c/loops/eureka_05.i
[2021-10-28 23:32:23,189 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/data/8404dff81/2596ab4aa92b4828bc487d3efdbc130e/FLAG78bf77686
[2021-10-28 23:32:23,535 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/data/8404dff81/2596ab4aa92b4828bc487d3efdbc130e
[2021-10-28 23:32:23,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-28 23:32:23,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-28 23:32:23,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-28 23:32:23,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-28 23:32:23,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-28 23:32:23,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:32:23" (1/1) ...
[2021-10-28 23:32:23,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463bffba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:32:23, skipping insertion in model container
[2021-10-28 23:32:23,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:32:23" (1/1) ...
[2021-10-28 23:32:23,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-10-28 23:32:23,601 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-10-28 23:32:23,907 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_4538c75d-d595-4515-87f2-a330d27a28a7/sv-benchmarks/c/loops/eureka_05.i[810,823]
[2021-10-28 23:32:23,934 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-28 23:32:23,951 INFO L203 MainTranslator]: Completed pre-run
[2021-10-28 23:32:23,969 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_4538c75d-d595-4515-87f2-a330d27a28a7/sv-benchmarks/c/loops/eureka_05.i[810,823]
[2021-10-28 23:32:23,999 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-28 23:32:24,018 INFO L208 MainTranslator]: Completed translation
[2021-10-28 23:32:24,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:32:24 WrapperNode
[2021-10-28 23:32:24,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-28 23:32:24,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-28 23:32:24,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-28 23:32:24,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-28 23:32:24,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:32:24" (1/1) ...
[2021-10-28 23:32:24,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:32:24" (1/1) ...
[2021-10-28 23:32:24,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-28 23:32:24,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-28 23:32:24,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-28 23:32:24,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-10-28 23:32:24,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:32:24" (1/1) ...
[2021-10-28 23:32:24,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:32:24" (1/1) ...
[2021-10-28 23:32:24,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:32:24" (1/1) ...
[2021-10-28 23:32:24,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:32:24" (1/1) ...
[2021-10-28 23:32:24,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:32:24" (1/1) ...
[2021-10-28 23:32:24,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:32:24" (1/1) ...
[2021-10-28 23:32:24,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:32:24" (1/1) ...
[2021-10-28 23:32:24,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-28 23:32:24,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-28 23:32:24,174 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-10-28 23:32:24,174 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-10-28 23:32:24,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:32:24" (1/1) ...
[2021-10-28 23:32:24,187 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-10-28 23:32:24,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:24,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2021-10-28 23:32:24,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2021-10-28 23:32:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-28 23:32:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-28 23:32:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-10-28 23:32:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-28 23:32:24,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-28 23:32:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2021-10-28 23:32:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-28 23:32:24,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-28 23:32:24,715 INFO L299 CfgBuilder]: Removed 12 assume(true) statements.
[2021-10-28 23:32:24,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:32:24 BoogieIcfgContainer
[2021-10-28 23:32:24,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-28 23:32:24,720 INFO L113 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2021-10-28 23:32:24,720 INFO L271 PluginConnector]: Initializing BuchiAutomizer...
[2021-10-28 23:32:24,724 INFO L275 PluginConnector]: BuchiAutomizer initialized
[2021-10-28 23:32:24,725 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-10-28 23:32:24,725 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.10 11:32:23" (1/3) ...
[2021-10-28 23:32:24,737 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@605867bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 11:32:24, skipping insertion in model container
[2021-10-28 23:32:24,737 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-10-28 23:32:24,737 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:32:24" (2/3) ...
[2021-10-28 23:32:24,738 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@605867bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 11:32:24, skipping insertion in model container
[2021-10-28 23:32:24,738 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-10-28 23:32:24,738 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:32:24" (3/3) ...
[2021-10-28 23:32:24,740 INFO L389 chiAutomizerObserver]: Analyzing ICFG eureka_05.i
[2021-10-28 23:32:24,819 INFO L359 BuchiCegarLoop]: Interprodecural is true
[2021-10-28 23:32:24,819 INFO L360 BuchiCegarLoop]: Hoare is false
[2021-10-28 23:32:24,819 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2021-10-28 23:32:24,820 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2021-10-28 23:32:24,820 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-10-28 23:32:24,820 INFO L364 BuchiCegarLoop]: Difference is false
[2021-10-28 23:32:24,820 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-10-28 23:32:24,820 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop========
[2021-10-28 23:32:24,843 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 23:32:24,874 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2021-10-28 23:32:24,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 23:32:24,875 INFO L119 BuchiIsEmpty]: Starting construction of run
[2021-10-28 23:32:24,881 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-10-28 23:32:24,881 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1]
[2021-10-28 23:32:24,882 INFO L425 BuchiCegarLoop]: ======== Iteration 1============
[2021-10-28 23:32:24,882 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 23:32:24,887 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2021-10-28 23:32:24,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 23:32:24,887 INFO L119 BuchiIsEmpty]: Starting construction of run
[2021-10-28 23:32:24,888 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-10-28 23:32:24,888 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1]
[2021-10-28 23:32:24,895 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 23:32:24,896 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 23:32:24,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:24,910 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2021-10-28 23:32:24,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:24,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504917413]
[2021-10-28 23:32:24,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:24,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:25,094 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:32:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:25,179 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:32:25,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:25,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times
[2021-10-28 23:32:25,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:25,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545756981]
[2021-10-28 23:32:25,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:25,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:25,221 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:32:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:25,231 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:32:25,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:25,233 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times
[2021-10-28 23:32:25,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:25,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607744902]
[2021-10-28 23:32:25,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:25,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:25,309 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:32:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:25,368 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:32:26,431 INFO L210 LassoAnalysis]: Preferences:
[2021-10-28 23:32:26,432 INFO L126 ssoRankerPreferences]: Compute integeral hull: false
[2021-10-28 23:32:26,432 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2021-10-28 23:32:26,432 INFO L128 ssoRankerPreferences]: Term annotations enabled: false
[2021-10-28 23:32:26,433 INFO L129 ssoRankerPreferences]: Use exernal solver: false
[2021-10-28 23:32:26,433 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-10-28 23:32:26,434 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false
[2021-10-28 23:32:26,434 INFO L132 ssoRankerPreferences]: Path of dumped script:
[2021-10-28 23:32:26,434 INFO L133 ssoRankerPreferences]: Filename of dumped script: eureka_05.i_Iteration1_Lasso
[2021-10-28 23:32:26,435 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank
[2021-10-28 23:32:26,435 INFO L276 LassoAnalysis]: Starting lasso preprocessing...
[2021-10-28 23:32:26,474 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 23:32:26,481 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 23:32:26,485 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 23:32:26,492 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 23:32:26,495 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 23:32:26,498 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 23:32:27,051 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 23:32:27,056 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 23:32:27,060 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 23:32:27,524 INFO L294 LassoAnalysis]: Preprocessing complete.
[2021-10-28 23:32:27,531 INFO L490 LassoAnalysis]: Using template 'affine'.
[2021-10-28 23:32:27,532 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-10-28 23:32:27,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:27,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2021-10-28 23:32:27,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process
[2021-10-28 23:32:27,538 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 23:32:27,549 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2021-10-28 23:32:27,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2021-10-28 23:32:27,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2021-10-28 23:32:27,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2021-10-28 23:32:27,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2021-10-28 23:32:27,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2021-10-28 23:32:27,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2021-10-28 23:32:27,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2021-10-28 23:32:27,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0
[2021-10-28 23:32:27,593 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-10-28 23:32:27,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:27,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2021-10-28 23:32:27,609 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 23:32:27,620 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2021-10-28 23:32:27,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2021-10-28 23:32:27,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2021-10-28 23:32:27,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2021-10-28 23:32:27,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2021-10-28 23:32:27,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2021-10-28 23:32:27,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2021-10-28 23:32:27,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process
[2021-10-28 23:32:27,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2021-10-28 23:32:27,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0
[2021-10-28 23:32:27,669 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-10-28 23:32:27,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:27,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2021-10-28 23:32:27,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2021-10-28 23:32:27,677 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 23:32:27,685 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2021-10-28 23:32:27,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2021-10-28 23:32:27,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2021-10-28 23:32:27,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2021-10-28 23:32:27,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2021-10-28 23:32:27,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2021-10-28 23:32:27,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2021-10-28 23:32:27,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0
[2021-10-28 23:32:27,775 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-10-28 23:32:27,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:27,776 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2021-10-28 23:32:27,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2021-10-28 23:32:27,781 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 23:32:27,790 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2021-10-28 23:32:27,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2021-10-28 23:32:27,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2021-10-28 23:32:27,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2021-10-28 23:32:27,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2021-10-28 23:32:27,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2021-10-28 23:32:27,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2021-10-28 23:32:27,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2021-10-28 23:32:27,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0
[2021-10-28 23:32:27,834 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-10-28 23:32:27,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:27,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2021-10-28 23:32:27,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2021-10-28 23:32:27,844 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 23:32:27,853 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2021-10-28 23:32:27,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2021-10-28 23:32:27,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2021-10-28 23:32:27,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2021-10-28 23:32:27,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2021-10-28 23:32:27,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2021-10-28 23:32:27,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2021-10-28 23:32:27,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0
[2021-10-28 23:32:27,905 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-10-28 23:32:27,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:27,906 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2021-10-28 23:32:27,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process
[2021-10-28 23:32:27,918 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 23:32:27,929 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2021-10-28 23:32:27,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2021-10-28 23:32:27,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2021-10-28 23:32:27,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2021-10-28 23:32:27,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2021-10-28 23:32:27,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2021-10-28 23:32:27,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings.
[2021-10-28 23:32:28,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0
[2021-10-28 23:32:28,003 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-10-28 23:32:28,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:28,004 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2021-10-28 23:32:28,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process
[2021-10-28 23:32:28,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2021-10-28 23:32:28,017 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2021-10-28 23:32:28,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2021-10-28 23:32:28,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2021-10-28 23:32:28,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2021-10-28 23:32:28,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2021-10-28 23:32:28,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2021-10-28 23:32:28,067 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2021-10-28 23:32:28,111 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver.
[2021-10-28 23:32:28,111 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero.
[2021-10-28 23:32:28,114 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-10-28 23:32:28,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:28,116 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2021-10-28 23:32:28,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process
[2021-10-28 23:32:28,122 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2021-10-28 23:32:28,143 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2021-10-28 23:32:28,143 INFO L513 LassoAnalysis]: Proved termination.
[2021-10-28 23:32:28,144 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 23:32:28,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0
[2021-10-28 23:32:28,327 INFO L297 tatePredicateManager]: 31 out of 31 supporting invariants were superfluous and have been removed
[2021-10-28 23:32:28,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:32:28,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core
[2021-10-28 23:32:28,437 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-10-28 23:32:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:32:28,492 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core
[2021-10-28 23:32:28,492 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-10-28 23:32:28,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0
[2021-10-28 23:32:28,558 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 23:32:28,573 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 23:32:28,574 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 23:32:28,634 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 23:32:28,635 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 23:32:28,637 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 23:32:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions.
[2021-10-28 23:32:28,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 2 letters. Loop has 2 letters.
[2021-10-28 23:32:28,640 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2021-10-28 23:32:28,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 4 letters. Loop has 2 letters.
[2021-10-28 23:32:28,641 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2021-10-28 23:32:28,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 2 letters. Loop has 4 letters.
[2021-10-28 23:32:28,641 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2021-10-28 23:32:28,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 71 transitions.
[2021-10-28 23:32:28,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11
[2021-10-28 23:32:28,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 18 states and 24 transitions.
[2021-10-28 23:32:28,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15
[2021-10-28 23:32:28,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16
[2021-10-28 23:32:28,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions.
[2021-10-28 23:32:28,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 23:32:28,657 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions.
[2021-10-28 23:32:28,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions.
[2021-10-28 23:32:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18.
[2021-10-28 23:32:28,678 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 23:32:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions.
[2021-10-28 23:32:28,680 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions.
[2021-10-28 23:32:28,680 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions.
[2021-10-28 23:32:28,680 INFO L425 BuchiCegarLoop]: ======== Iteration 2============
[2021-10-28 23:32:28,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions.
[2021-10-28 23:32:28,681 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11
[2021-10-28 23:32:28,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 23:32:28,682 INFO L119 BuchiIsEmpty]: Starting construction of run
[2021-10-28 23:32:28,682 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1]
[2021-10-28 23:32:28,682 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2021-10-28 23:32:28,683 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 23:32:28,683 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 23:32:28,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times
[2021-10-28 23:32:28,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:28,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703517948]
[2021-10-28 23:32:28,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:28,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:32:28,755 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 23:32:28,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:32:28,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703517948]
[2021-10-28 23:32:28,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703517948] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:32:28,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:32:28,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:32:28,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361112943]
[2021-10-28 23:32:28,764 INFO L796 eck$LassoCheckResult]: stem already infeasible
[2021-10-28 23:32:28,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:28,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 1 times
[2021-10-28 23:32:28,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:28,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378235236]
[2021-10-28 23:32:28,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:28,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:28,787 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:32:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:28,818 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:32:28,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:32:28,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:32:28,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:32:28,973 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 23:32:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:32:29,014 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions.
[2021-10-28 23:32:29,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-28 23:32:29,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions.
[2021-10-28 23:32:29,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10
[2021-10-28 23:32:29,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 22 transitions.
[2021-10-28 23:32:29,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15
[2021-10-28 23:32:29,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15
[2021-10-28 23:32:29,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions.
[2021-10-28 23:32:29,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 23:32:29,023 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions.
[2021-10-28 23:32:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions.
[2021-10-28 23:32:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17.
[2021-10-28 23:32:29,027 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 23:32:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions.
[2021-10-28 23:32:29,030 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions.
[2021-10-28 23:32:29,031 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions.
[2021-10-28 23:32:29,031 INFO L425 BuchiCegarLoop]: ======== Iteration 3============
[2021-10-28 23:32:29,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions.
[2021-10-28 23:32:29,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10
[2021-10-28 23:32:29,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 23:32:29,033 INFO L119 BuchiIsEmpty]: Starting construction of run
[2021-10-28 23:32:29,033 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1]
[2021-10-28 23:32:29,034 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2021-10-28 23:32:29,034 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 23:32:29,034 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 23:32:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:29,035 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times
[2021-10-28 23:32:29,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:29,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387131614]
[2021-10-28 23:32:29,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:29,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:32:29,113 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 23:32:29,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:32:29,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387131614]
[2021-10-28 23:32:29,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387131614] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-28 23:32:29,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486172568]
[2021-10-28 23:32:29,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:29,115 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-10-28 23:32:29,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:29,116 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-10-28 23:32:29,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2021-10-28 23:32:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:32:29,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core
[2021-10-28 23:32:29,185 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-10-28 23:32:29,208 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 23:32:29,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486172568] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-28 23:32:29,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-10-28 23:32:29,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4
[2021-10-28 23:32:29,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196730850]
[2021-10-28 23:32:29,210 INFO L796 eck$LassoCheckResult]: stem already infeasible
[2021-10-28 23:32:29,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:29,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 2 times
[2021-10-28 23:32:29,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:29,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056885195]
[2021-10-28 23:32:29,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:29,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:29,221 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:32:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:29,241 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:32:29,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:32:29,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-28 23:32:29,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-28 23:32:29,390 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 23:32:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:32:29,423 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions.
[2021-10-28 23:32:29,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-10-28 23:32:29,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions.
[2021-10-28 23:32:29,427 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10
[2021-10-28 23:32:29,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions.
[2021-10-28 23:32:29,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15
[2021-10-28 23:32:29,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15
[2021-10-28 23:32:29,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions.
[2021-10-28 23:32:29,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 23:32:29,430 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions.
[2021-10-28 23:32:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions.
[2021-10-28 23:32:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19.
[2021-10-28 23:32:29,434 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 23:32:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions.
[2021-10-28 23:32:29,435 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions.
[2021-10-28 23:32:29,435 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions.
[2021-10-28 23:32:29,435 INFO L425 BuchiCegarLoop]: ======== Iteration 4============
[2021-10-28 23:32:29,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions.
[2021-10-28 23:32:29,438 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10
[2021-10-28 23:32:29,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 23:32:29,438 INFO L119 BuchiIsEmpty]: Starting construction of run
[2021-10-28 23:32:29,439 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1]
[2021-10-28 23:32:29,439 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2021-10-28 23:32:29,440 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 23:32:29,440 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 23:32:29,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:29,440 INFO L85 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times
[2021-10-28 23:32:29,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:29,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017530081]
[2021-10-28 23:32:29,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:29,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:32:29,514 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 23:32:29,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:32:29,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017530081]
[2021-10-28 23:32:29,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017530081] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-28 23:32:29,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262273914]
[2021-10-28 23:32:29,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2021-10-28 23:32:29,516 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-10-28 23:32:29,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:29,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-10-28 23:32:29,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2021-10-28 23:32:29,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2021-10-28 23:32:29,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2021-10-28 23:32:29,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core
[2021-10-28 23:32:29,612 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-10-28 23:32:29,651 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 23:32:29,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262273914] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-28 23:32:29,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-10-28 23:32:29,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5
[2021-10-28 23:32:29,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155164335]
[2021-10-28 23:32:29,653 INFO L796 eck$LassoCheckResult]: stem already infeasible
[2021-10-28 23:32:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 3 times
[2021-10-28 23:32:29,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:29,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481223908]
[2021-10-28 23:32:29,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:29,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:29,662 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:32:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:29,673 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:32:29,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:32:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-28 23:32:29,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2021-10-28 23:32:29,818 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 23:32:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:32:29,853 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions.
[2021-10-28 23:32:29,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-28 23:32:29,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions.
[2021-10-28 23:32:29,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10
[2021-10-28 23:32:29,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions.
[2021-10-28 23:32:29,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15
[2021-10-28 23:32:29,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15
[2021-10-28 23:32:29,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions.
[2021-10-28 23:32:29,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 23:32:29,856 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions.
[2021-10-28 23:32:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions.
[2021-10-28 23:32:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21.
[2021-10-28 23:32:29,859 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 23:32:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions.
[2021-10-28 23:32:29,860 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions.
[2021-10-28 23:32:29,860 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions.
[2021-10-28 23:32:29,860 INFO L425 BuchiCegarLoop]: ======== Iteration 5============
[2021-10-28 23:32:29,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions.
[2021-10-28 23:32:29,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10
[2021-10-28 23:32:29,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 23:32:29,861 INFO L119 BuchiIsEmpty]: Starting construction of run
[2021-10-28 23:32:29,861 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1]
[2021-10-28 23:32:29,862 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2021-10-28 23:32:29,862 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 23:32:29,862 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 23:32:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times
[2021-10-28 23:32:29,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:29,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808339899]
[2021-10-28 23:32:29,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:29,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:32:29,952 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 23:32:29,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:32:29,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808339899]
[2021-10-28 23:32:29,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808339899] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-28 23:32:29,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982027161]
[2021-10-28 23:32:29,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2021-10-28 23:32:29,954 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-10-28 23:32:29,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:29,957 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-10-28 23:32:29,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2021-10-28 23:32:30,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2021-10-28 23:32:30,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2021-10-28 23:32:30,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core
[2021-10-28 23:32:30,038 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-10-28 23:32:30,094 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 23:32:30,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982027161] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-28 23:32:30,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-10-28 23:32:30,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6
[2021-10-28 23:32:30,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728604882]
[2021-10-28 23:32:30,096 INFO L796 eck$LassoCheckResult]: stem already infeasible
[2021-10-28 23:32:30,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:30,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 4 times
[2021-10-28 23:32:30,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:30,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403305216]
[2021-10-28 23:32:30,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:30,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:30,117 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:32:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:30,133 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:32:30,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:32:30,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-28 23:32:30,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2021-10-28 23:32:30,282 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 23:32:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:32:30,319 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions.
[2021-10-28 23:32:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-28 23:32:30,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions.
[2021-10-28 23:32:30,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10
[2021-10-28 23:32:30,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions.
[2021-10-28 23:32:30,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15
[2021-10-28 23:32:30,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15
[2021-10-28 23:32:30,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions.
[2021-10-28 23:32:30,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 23:32:30,325 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions.
[2021-10-28 23:32:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions.
[2021-10-28 23:32:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23.
[2021-10-28 23:32:30,329 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 23:32:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions.
[2021-10-28 23:32:30,330 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions.
[2021-10-28 23:32:30,330 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions.
[2021-10-28 23:32:30,330 INFO L425 BuchiCegarLoop]: ======== Iteration 6============
[2021-10-28 23:32:30,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions.
[2021-10-28 23:32:30,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10
[2021-10-28 23:32:30,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 23:32:30,334 INFO L119 BuchiIsEmpty]: Starting construction of run
[2021-10-28 23:32:30,335 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1]
[2021-10-28 23:32:30,335 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2021-10-28 23:32:30,336 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 23:32:30,338 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 23:32:30,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times
[2021-10-28 23:32:30,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:30,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744462384]
[2021-10-28 23:32:30,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:30,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:32:30,432 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 23:32:30,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:32:30,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744462384]
[2021-10-28 23:32:30,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744462384] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-28 23:32:30,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080633372]
[2021-10-28 23:32:30,433 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2021-10-28 23:32:30,433 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-10-28 23:32:30,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:30,441 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-10-28 23:32:30,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2021-10-28 23:32:30,514 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2021-10-28 23:32:30,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2021-10-28 23:32:30,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core
[2021-10-28 23:32:30,517 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-10-28 23:32:30,564 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 23:32:30,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080633372] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-28 23:32:30,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-10-28 23:32:30,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7
[2021-10-28 23:32:30,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024091787]
[2021-10-28 23:32:30,565 INFO L796 eck$LassoCheckResult]: stem already infeasible
[2021-10-28 23:32:30,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:30,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 5 times
[2021-10-28 23:32:30,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:30,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245645149]
[2021-10-28 23:32:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:30,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:30,574 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:32:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:30,581 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:32:30,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:32:30,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-28 23:32:30,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2021-10-28 23:32:30,711 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 23:32:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:32:30,770 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions.
[2021-10-28 23:32:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-28 23:32:30,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions.
[2021-10-28 23:32:30,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10
[2021-10-28 23:32:30,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 45 transitions.
[2021-10-28 23:32:30,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31
[2021-10-28 23:32:30,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31
[2021-10-28 23:32:30,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 45 transitions.
[2021-10-28 23:32:30,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 23:32:30,774 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions.
[2021-10-28 23:32:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 45 transitions.
[2021-10-28 23:32:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25.
[2021-10-28 23:32:30,776 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 23:32:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions.
[2021-10-28 23:32:30,777 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions.
[2021-10-28 23:32:30,777 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions.
[2021-10-28 23:32:30,777 INFO L425 BuchiCegarLoop]: ======== Iteration 7============
[2021-10-28 23:32:30,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions.
[2021-10-28 23:32:30,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10
[2021-10-28 23:32:30,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 23:32:30,778 INFO L119 BuchiIsEmpty]: Starting construction of run
[2021-10-28 23:32:30,779 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1]
[2021-10-28 23:32:30,779 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2021-10-28 23:32:30,779 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 23:32:30,779 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 23:32:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:30,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times
[2021-10-28 23:32:30,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:30,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906203921]
[2021-10-28 23:32:30,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:30,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:30,797 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:32:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:30,819 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:32:30,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1668713, now seen corresponding path program 6 times
[2021-10-28 23:32:30,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:30,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380780477]
[2021-10-28 23:32:30,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:30,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:30,827 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:32:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:30,834 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:32:30,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:30,835 INFO L85 PathProgramCache]: Analyzing trace with hash -743535747, now seen corresponding path program 1 times
[2021-10-28 23:32:30,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:30,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906623126]
[2021-10-28 23:32:30,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:30,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:32:30,893 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 23:32:30,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:32:30,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906623126]
[2021-10-28 23:32:30,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906623126] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:32:30,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:32:30,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-28 23:32:30,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903642360]
[2021-10-28 23:32:31,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:32:31,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-28 23:32:31,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-28 23:32:31,022 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 23:32:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:32:31,075 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions.
[2021-10-28 23:32:31,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-28 23:32:31,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions.
[2021-10-28 23:32:31,077 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13
[2021-10-28 23:32:31,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 41 transitions.
[2021-10-28 23:32:31,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24
[2021-10-28 23:32:31,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24
[2021-10-28 23:32:31,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions.
[2021-10-28 23:32:31,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 23:32:31,079 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions.
[2021-10-28 23:32:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions.
[2021-10-28 23:32:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27.
[2021-10-28 23:32:31,081 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 23:32:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions.
[2021-10-28 23:32:31,082 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions.
[2021-10-28 23:32:31,082 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions.
[2021-10-28 23:32:31,082 INFO L425 BuchiCegarLoop]: ======== Iteration 8============
[2021-10-28 23:32:31,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions.
[2021-10-28 23:32:31,083 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10
[2021-10-28 23:32:31,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 23:32:31,083 INFO L119 BuchiIsEmpty]: Starting construction of run
[2021-10-28 23:32:31,084 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:32:31,084 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2021-10-28 23:32:31,084 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 23:32:31,084 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 23:32:31,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425501, now seen corresponding path program 1 times
[2021-10-28 23:32:31,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:31,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835023268]
[2021-10-28 23:32:31,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:31,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:31,136 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:32:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:31,163 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:32:31,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash 64667, now seen corresponding path program 1 times
[2021-10-28 23:32:31,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:31,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421417192]
[2021-10-28 23:32:31,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:31,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:31,169 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:32:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:32:31,175 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:32:31,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:32:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1574719937, now seen corresponding path program 1 times
[2021-10-28 23:32:31,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:32:31,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513523349]
[2021-10-28 23:32:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:31,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:32:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:32:31,626 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 23:32:31,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:32:31,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513523349]
[2021-10-28 23:32:31,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513523349] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-28 23:32:31,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727600964]
[2021-10-28 23:32:31,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:32:31,627 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-10-28 23:32:31,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:32:31,632 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-10-28 23:32:31,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2021-10-28 23:32:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:32:31,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core
[2021-10-28 23:32:31,796 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-10-28 23:32:31,898 INFO L354 Elim1Store]: treesize reduction 83, result has 23.9 percent of original size
[2021-10-28 23:32:31,899 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 23:32:32,232 INFO L354 Elim1Store]: treesize reduction 44, result has 45.7 percent of original size
[2021-10-28 23:32:32,233 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 23:32:32,397 INFO L190 IndexEqualityManager]: detected not equals via solver
[2021-10-28 23:32:32,399 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 23:32:32,518 INFO L190 IndexEqualityManager]: detected not equals via solver
[2021-10-28 23:32:32,530 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2021-10-28 23:32:32,531 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 23:32:32,655 INFO L190 IndexEqualityManager]: detected not equals via solver
[2021-10-28 23:32:32,666 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2021-10-28 23:32:32,667 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 23:32:32,759 INFO L190 IndexEqualityManager]: detected not equals via solver
[2021-10-28 23:32:32,771 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2021-10-28 23:32:32,772 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 23:32:32,877 INFO L190 IndexEqualityManager]: detected not equals via solver
[2021-10-28 23:32:32,907 INFO L354 Elim1Store]: treesize reduction 140, result has 16.7 percent of original size
[2021-10-28 23:32:32,908 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 23:34:21,120 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 30
[2021-10-28 23:34:45,476 WARN L207 SmtUtils]: Spent 12.03 s on a formula simplification that was a NOOP. DAG size: 32
[2021-10-28 23:35:09,640 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 35
[2021-10-28 23:35:09,683 INFO L173 IndexEqualityManager]: detected equality via solver
[2021-10-28 23:35:09,685 INFO L190 IndexEqualityManager]: detected not equals via solver
[2021-10-28 23:35:09,699 INFO L354 Elim1Store]: treesize reduction 117, result has 2.5 percent of original size
[2021-10-28 23:35:09,700 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 23:35:09,750 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 23:35:09,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727600964] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-28 23:35:09,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-10-28 23:35:09,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15
[2021-10-28 23:35:09,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113192436]
[2021-10-28 23:35:09,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:35:09,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-10-28 23:35:09,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=189, Unknown=10, NotChecked=0, Total=240
[2021-10-28 23:35:09,882 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 23:35:34,001 WARN L207 SmtUtils]: Spent 24.06 s on a formula simplification. DAG size of input: 50 DAG size of output: 48
[2021-10-28 23:37:10,471 WARN L207 SmtUtils]: Spent 24.09 s on a formula simplification. DAG size of input: 60 DAG size of output: 53
[2021-10-28 23:37:34,586 WARN L207 SmtUtils]: Spent 24.09 s on a formula simplification. DAG size of input: 78 DAG size of output: 60
[2021-10-28 23:37:58,705 WARN L207 SmtUtils]: Spent 24.10 s on a formula simplification. DAG size of input: 84 DAG size of output: 64
[2021-10-28 23:39:11,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:39:11,123 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions.
[2021-10-28 23:39:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-10-28 23:39:11,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions.
[2021-10-28 23:39:11,124 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2021-10-28 23:39:11,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 40 transitions.
[2021-10-28 23:39:11,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24
[2021-10-28 23:39:11,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24
[2021-10-28 23:39:11,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions.
[2021-10-28 23:39:11,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 23:39:11,125 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions.
[2021-10-28 23:39:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions.
[2021-10-28 23:39:11,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28.
[2021-10-28 23:39:11,128 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 23:39:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions.
[2021-10-28 23:39:11,128 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions.
[2021-10-28 23:39:11,129 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions.
[2021-10-28 23:39:11,129 INFO L425 BuchiCegarLoop]: ======== Iteration 9============
[2021-10-28 23:39:11,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions.
[2021-10-28 23:39:11,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10
[2021-10-28 23:39:11,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 23:39:11,130 INFO L119 BuchiIsEmpty]: Starting construction of run
[2021-10-28 23:39:11,130 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:39:11,130 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2021-10-28 23:39:11,131 INFO L791 eck$LassoCheckResult]: Stem: 820#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; 821#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; 822#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); 823#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 824#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); 825#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 844#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); 843#L44-2 main_#t~post9 := main_~i~1;main_~i~1 := main_#t~post9 - 1;havoc main_#t~post9; 842#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); 826#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; 827#L30-3 assume !!(SelectionSort_~lh~0 < ~n~0);SelectionSort_~rh~0 := SelectionSort_~lh~0;SelectionSort_~i~0 := 1 + SelectionSort_~lh~0; 836#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); 832#L33 assume !(SelectionSort_#t~mem5 < SelectionSort_#t~mem6);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem6; 833#L32-2
[2021-10-28 23:39:11,131 INFO L793 eck$LassoCheckResult]: Loop: 833#L32-2 SelectionSort_#t~post4 := SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_#t~post4;havoc SelectionSort_#t~post4; 835#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); 845#L33 assume SelectionSort_#t~mem5 < SelectionSort_#t~mem6;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem6;SelectionSort_~rh~0 := SelectionSort_~i~0; 833#L32-2
[2021-10-28 23:39:11,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:39:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1638583016, now seen corresponding path program 1 times
[2021-10-28 23:39:11,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:39:11,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449922032]
[2021-10-28 23:39:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:39:11,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:39:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:39:11,144 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:39:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:39:11,161 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:39:11,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:39:11,161 INFO L85 PathProgramCache]: Analyzing trace with hash 68297, now seen corresponding path program 2 times
[2021-10-28 23:39:11,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:39:11,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431731441]
[2021-10-28 23:39:11,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:39:11,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:39:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:39:11,167 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:39:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:39:11,172 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:39:11,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:39:11,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1571618174, now seen corresponding path program 1 times
[2021-10-28 23:39:11,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:39:11,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859969098]
[2021-10-28 23:39:11,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:39:11,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:39:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:39:11,587 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 23:39:11,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:39:11,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859969098]
[2021-10-28 23:39:11,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859969098] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-28 23:39:11,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440702541]
[2021-10-28 23:39:11,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:39:11,588 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-10-28 23:39:11,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:39:11,591 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-10-28 23:39:11,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2021-10-28 23:39:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:39:11,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 23 conjunts are in the unsatisfiable core
[2021-10-28 23:39:11,734 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-10-28 23:39:11,794 INFO L354 Elim1Store]: treesize reduction 83, result has 23.9 percent of original size
[2021-10-28 23:39:11,795 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 23:39:12,037 INFO L354 Elim1Store]: treesize reduction 44, result has 45.7 percent of original size
[2021-10-28 23:39:12,038 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 23:39:12,173 INFO L190 IndexEqualityManager]: detected not equals via solver
[2021-10-28 23:39:12,174 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 23:39:12,291 INFO L190 IndexEqualityManager]: detected not equals via solver
[2021-10-28 23:39:12,302 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2021-10-28 23:39:12,303 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 23:39:12,398 INFO L190 IndexEqualityManager]: detected not equals via solver
[2021-10-28 23:39:12,409 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2021-10-28 23:39:12,410 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 23:39:12,506 INFO L190 IndexEqualityManager]: detected not equals via solver
[2021-10-28 23:39:12,518 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size
[2021-10-28 23:39:12,518 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 23:39:12,610 INFO L190 IndexEqualityManager]: detected not equals via solver
[2021-10-28 23:39:12,640 INFO L354 Elim1Store]: treesize reduction 140, result has 16.7 percent of original size
[2021-10-28 23:39:12,640 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 23:39:48,764 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 31
[2021-10-28 23:40:01,024 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 33
[2021-10-28 23:40:13,165 WARN L207 SmtUtils]: Spent 12.03 s on a formula simplification that was a NOOP. DAG size: 36
[2021-10-28 23:40:25,410 WARN L207 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 36
[2021-10-28 23:40:25,444 INFO L354 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size
[2021-10-28 23:40:25,445 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 23:40:25,478 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 23:40:25,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440702541] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-28 23:40:25,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-10-28 23:40:25,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17
[2021-10-28 23:40:25,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041571963]
[2021-10-28 23:40:25,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:40:25,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2021-10-28 23:40:25,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=295, Unknown=2, NotChecked=0, Total=342
[2021-10-28 23:40:25,568 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 23:41:38,002 WARN L207 SmtUtils]: Spent 12.12 s on a formula simplification. DAG size of input: 56 DAG size of output: 48
[2021-10-28 23:42:02,145 WARN L207 SmtUtils]: Spent 24.12 s on a formula simplification. DAG size of input: 70 DAG size of output: 61
[2021-10-28 23:42:26,298 WARN L207 SmtUtils]: Spent 24.13 s on a formula simplification. DAG size of input: 75 DAG size of output: 68
[2021-10-28 23:43:05,365 WARN L228 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1) with exit command (exit)) stderr output: (error "out of memory")
[2021-10-28 23:43:05,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 101
[2021-10-28 23:43:05,367 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_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/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.logic.WrapperScript.checkSat(WrapperScript.java:163)
at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61)
at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120)
at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371)
at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115)
at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106)
at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:184)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:174)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:140)
at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360)
at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388)
at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79)
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.<init>(NestedWordAutomatonReachableStates.java:960)
at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.<init>(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.<init>(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)
... 47 more
[2021-10-28 23:43:05,370 INFO L168 Benchmark]: Toolchain (without parser) took 641821.13 ms. Allocated memory was 104.9 MB in the beginning and 201.3 MB in the end (delta: 96.5 MB). Free memory was 72.8 MB in the beginning and 74.3 MB in the end (delta: -1.5 MB). Peak memory consumption was 95.4 MB. Max. memory is 16.1 GB.
[2021-10-28 23:43:05,371 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 104.9 MB. Free memory is still 62.4 MB. There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-28 23:43:05,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 464.38 ms. Allocated memory was 104.9 MB in the beginning and 159.4 MB in the end (delta: 54.5 MB). Free memory was 72.6 MB in the beginning and 133.4 MB in the end (delta: -60.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB.
[2021-10-28 23:43:05,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.35 ms. Allocated memory is still 159.4 MB. Free memory was 133.4 MB in the beginning and 132.0 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-28 23:43:05,372 INFO L168 Benchmark]: Boogie Preprocessor took 66.03 ms. Allocated memory is still 159.4 MB. Free memory was 132.0 MB in the beginning and 130.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-28 23:43:05,372 INFO L168 Benchmark]: RCFGBuilder took 546.50 ms. Allocated memory is still 159.4 MB. Free memory was 130.3 MB in the beginning and 119.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB.
[2021-10-28 23:43:05,372 INFO L168 Benchmark]: BuchiAutomizer took 640650.02 ms. Allocated memory was 159.4 MB in the beginning and 201.3 MB in the end (delta: 41.9 MB). Free memory was 119.4 MB in the beginning and 74.3 MB in the end (delta: 45.1 MB). Peak memory consumption was 90.2 MB. Max. memory is 16.1 GB.
[2021-10-28 23:43:05,375 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.32 ms. Allocated memory is still 104.9 MB. Free memory is still 62.4 MB. There was no memory consumed. Max. memory is 16.1 GB.
* CACSL2BoogieTranslator took 464.38 ms. Allocated memory was 104.9 MB in the beginning and 159.4 MB in the end (delta: 54.5 MB). Free memory was 72.6 MB in the beginning and 133.4 MB in the end (delta: -60.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB.
* Boogie Procedure Inliner took 84.35 ms. Allocated memory is still 159.4 MB. Free memory was 133.4 MB in the beginning and 132.0 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB.
* Boogie Preprocessor took 66.03 ms. Allocated memory is still 159.4 MB. Free memory was 132.0 MB in the beginning and 130.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* RCFGBuilder took 546.50 ms. Allocated memory is still 159.4 MB. Free memory was 130.3 MB in the beginning and 119.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB.
* BuchiAutomizer took 640650.02 ms. Allocated memory was 159.4 MB in the beginning and 201.3 MB in the end (delta: 41.9 MB). Free memory was 119.4 MB in the beginning and 74.3 MB in the end (delta: 45.1 MB). Peak memory consumption was 90.2 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_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/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_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/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 23:43:05,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2021-10-28 23:43:05,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2021-10-28 23:43:05,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2021-10-28 23:43:06,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2021-10-28 23:43:06,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2021-10-28 23:43:06,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4538c75d-d595-4515-87f2-a330d27a28a7/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
Received shutdown request...