./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y --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 fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 17:39:39,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 17:39:39,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 17:39:39,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 17:39:39,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 17:39:39,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 17:39:39,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 17:39:39,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 17:39:39,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 17:39:39,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 17:39:39,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 17:39:39,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 17:39:39,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 17:39:39,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 17:39:39,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 17:39:39,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 17:39:39,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 17:39:39,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 17:39:39,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 17:39:39,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 17:39:39,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 17:39:39,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 17:39:39,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 17:39:39,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 17:39:39,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 17:39:39,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 17:39:39,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 17:39:39,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 17:39:39,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 17:39:39,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 17:39:39,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 17:39:39,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 17:39:39,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 17:39:39,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 17:39:39,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 17:39:39,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 17:39:39,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 17:39:39,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 17:39:39,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 17:39:39,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 17:39:39,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 17:39:39,492 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-13 17:39:39,543 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 17:39:39,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 17:39:39,544 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-13 17:39:39,545 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-13 17:39:39,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-13 17:39:39,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-13 17:39:39,547 INFO L138 SettingsManager]: * Use SBE=true [2021-11-13 17:39:39,547 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-13 17:39:39,548 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-13 17:39:39,548 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-13 17:39:39,549 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-13 17:39:39,549 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-13 17:39:39,549 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-13 17:39:39,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 17:39:39,550 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 17:39:39,550 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-13 17:39:39,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 17:39:39,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 17:39:39,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 17:39:39,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-13 17:39:39,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-13 17:39:39,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-13 17:39:39,552 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 17:39:39,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 17:39:39,552 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-13 17:39:39,552 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 17:39:39,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-13 17:39:39,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 17:39:39,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 17:39:39,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 17:39:39,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-13 17:39:39,555 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 17:39:39,557 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-13 17:39:39,557 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_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/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_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y 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 -> fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 [2021-11-13 17:39:39,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 17:39:39,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 17:39:39,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 17:39:39,959 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 17:39:39,961 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 17:39:39,962 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/../../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2021-11-13 17:39:40,032 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/data/90bd508a4/608b8bd7f0b847ba9878fe196f6a66c7/FLAGb93d4766f [2021-11-13 17:39:40,574 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 17:39:40,574 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2021-11-13 17:39:40,584 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/data/90bd508a4/608b8bd7f0b847ba9878fe196f6a66c7/FLAGb93d4766f [2021-11-13 17:39:40,943 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/data/90bd508a4/608b8bd7f0b847ba9878fe196f6a66c7 [2021-11-13 17:39:40,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 17:39:40,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 17:39:40,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 17:39:40,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 17:39:40,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 17:39:40,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:39:40" (1/1) ... [2021-11-13 17:39:40,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@618dc4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:39:40, skipping insertion in model container [2021-11-13 17:39:40,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:39:40" (1/1) ... [2021-11-13 17:39:40,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 17:39:40,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 17:39:41,145 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_58dcde5e-1833-458b-adb1-59cbaa249184/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i[814,827] [2021-11-13 17:39:41,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:39:41,164 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 17:39:41,176 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_58dcde5e-1833-458b-adb1-59cbaa249184/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i[814,827] [2021-11-13 17:39:41,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:39:41,195 INFO L208 MainTranslator]: Completed translation [2021-11-13 17:39:41,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:39:41 WrapperNode [2021-11-13 17:39:41,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 17:39:41,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 17:39:41,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 17:39:41,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 17:39:41,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:39:41" (1/1) ... [2021-11-13 17:39:41,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:39:41" (1/1) ... [2021-11-13 17:39:41,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 17:39:41,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 17:39:41,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 17:39:41,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 17:39:41,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:39:41" (1/1) ... [2021-11-13 17:39:41,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:39:41" (1/1) ... [2021-11-13 17:39:41,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:39:41" (1/1) ... [2021-11-13 17:39:41,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:39:41" (1/1) ... [2021-11-13 17:39:41,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:39:41" (1/1) ... [2021-11-13 17:39:41,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:39:41" (1/1) ... [2021-11-13 17:39:41,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:39:41" (1/1) ... [2021-11-13 17:39:41,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 17:39:41,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 17:39:41,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 17:39:41,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 17:39:41,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:39:41" (1/1) ... [2021-11-13 17:39:41,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 17:39:41,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:39:41,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 17:39:41,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-13 17:39:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 17:39:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 17:39:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-13 17:39:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 17:39:41,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 17:39:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-13 17:39:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 17:39:41,622 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 17:39:41,622 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-13 17:39:41,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:39:41 BoogieIcfgContainer [2021-11-13 17:39:41,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 17:39:41,631 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-13 17:39:41,631 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-13 17:39:41,634 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-13 17:39:41,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-13 17:39:41,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 05:39:40" (1/3) ... [2021-11-13 17:39:41,653 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3916ba5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 05:39:41, skipping insertion in model container [2021-11-13 17:39:41,653 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-13 17:39:41,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:39:41" (2/3) ... [2021-11-13 17:39:41,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3916ba5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 05:39:41, skipping insertion in model container [2021-11-13 17:39:41,654 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-13 17:39:41,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:39:41" (3/3) ... [2021-11-13 17:39:41,655 INFO L388 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2021-11-13 17:39:41,699 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-13 17:39:41,700 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-13 17:39:41,700 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-13 17:39:41,700 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-13 17:39:41,700 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-13 17:39:41,700 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-13 17:39:41,701 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-13 17:39:41,701 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-13 17:39:41,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-11-13 17:39:41,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-11-13 17:39:41,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 17:39:41,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 17:39:41,756 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-13 17:39:41,756 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-13 17:39:41,756 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-13 17:39:41,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-11-13 17:39:41,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-11-13 17:39:41,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 17:39:41,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 17:39:41,775 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-13 17:39:41,775 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-13 17:39:41,782 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#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(24); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post3#1, main_#t~mem5#1, main_#t~post4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 13#L18-3true [2021-11-13 17:39:41,782 INFO L793 eck$LassoCheckResult]: Loop: 13#L18-3true assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 12#L18-2true main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 13#L18-3true [2021-11-13 17:39:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:41,799 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-11-13 17:39:41,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:39:41,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4678668] [2021-11-13 17:39:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:41,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:39:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:41,938 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:39:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:41,999 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:39:42,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:42,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-11-13 17:39:42,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:39:42,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250072981] [2021-11-13 17:39:42,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:42,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:39:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:42,033 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:39:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:42,049 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:39:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:42,054 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-11-13 17:39:42,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:39:42,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452480410] [2021-11-13 17:39:42,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:42,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:39:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:42,086 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:39:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:42,129 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:39:42,681 INFO L210 LassoAnalysis]: Preferences: [2021-11-13 17:39:42,681 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-13 17:39:42,682 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-13 17:39:42,682 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-13 17:39:42,682 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-13 17:39:42,682 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 17:39:42,682 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-13 17:39:42,682 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-13 17:39:42,682 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2021-11-13 17:39:42,683 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-13 17:39:42,683 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-13 17:39:42,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 17:39:42,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 17:39:42,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 17:39:42,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 17:39:42,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 17:39:42,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 17:39:42,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 17:39:42,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 17:39:43,226 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-13 17:39:43,230 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-13 17:39:43,232 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 17:39:43,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:39:43,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 17:39:43,241 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-11-13 17:39:43,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 17:39:43,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 17:39:43,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 17:39:43,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 17:39:43,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 17:39:43,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 17:39:43,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-13 17:39:43,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 17:39:43,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-11-13 17:39:43,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 17:39:43,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:39:43,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 17:39:43,330 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-11-13 17:39:43,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 17:39:43,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 17:39:43,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 17:39:43,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 17:39:43,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 17:39:43,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 17:39:43,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-13 17:39:43,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 17:39:43,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-11-13 17:39:43,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 17:39:43,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:39:43,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 17:39:43,406 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-11-13 17:39:43,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 17:39:43,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 17:39:43,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 17:39:43,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 17:39:43,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 17:39:43,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 17:39:43,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 17:39:43,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-13 17:39:43,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 17:39:43,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-11-13 17:39:43,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 17:39:43,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:39:43,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 17:39:43,477 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-11-13 17:39:43,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 17:39:43,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 17:39:43,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 17:39:43,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 17:39:43,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-13 17:39:43,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 17:39:43,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 17:39:43,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 17:39:43,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-11-13 17:39:43,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 17:39:43,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:39:43,544 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 17:39:43,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-13 17:39:43,553 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-11-13 17:39:43,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 17:39:43,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 17:39:43,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 17:39:43,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 17:39:43,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 17:39:43,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 17:39:43,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 17:39:43,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-11-13 17:39:43,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 17:39:43,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:39:43,619 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 17:39:43,627 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-11-13 17:39:43,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 17:39:43,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 17:39:43,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 17:39:43,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 17:39:43,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 17:39:43,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 17:39:43,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-13 17:39:43,674 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-13 17:39:43,704 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-11-13 17:39:43,704 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-11-13 17:39:43,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 17:39:43,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:39:43,711 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 17:39:43,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-13 17:39:43,717 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-13 17:39:43,739 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-13 17:39:43,739 INFO L513 LassoAnalysis]: Proved termination. [2021-11-13 17:39:43,740 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-11-13 17:39:43,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-13 17:39:43,800 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-11-13 17:39:43,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:39:43,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-13 17:39:43,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:39:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:39:43,862 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-13 17:39:43,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:39:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:39:43,970 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-11-13 17:39:43,972 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-11-13 17:39:44,022 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 29 states and 41 transitions. Complement of second has 8 states. [2021-11-13 17:39:44,023 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-11-13 17:39:44,028 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-11-13 17:39:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2021-11-13 17:39:44,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2021-11-13 17:39:44,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-13 17:39:44,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2021-11-13 17:39:44,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-13 17:39:44,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2021-11-13 17:39:44,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-13 17:39:44,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2021-11-13 17:39:44,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-11-13 17:39:44,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 16 transitions. [2021-11-13 17:39:44,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-11-13 17:39:44,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-11-13 17:39:44,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2021-11-13 17:39:44,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 17:39:44,048 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-11-13 17:39:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2021-11-13 17:39:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-13 17:39:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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-11-13 17:39:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-11-13 17:39:44,075 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-11-13 17:39:44,075 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-11-13 17:39:44,076 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-13 17:39:44,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2021-11-13 17:39:44,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-11-13 17:39:44,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 17:39:44,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 17:39:44,079 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-11-13 17:39:44,079 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-13 17:39:44,080 INFO L791 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#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(24); 115#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post3#1, main_#t~mem5#1, main_#t~post4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 121#L18-3 assume !(main_~i~0#1 < 100000); 119#L18-4 main_~i~0#1 := 0; 120#L22-3 [2021-11-13 17:39:44,081 INFO L793 eck$LassoCheckResult]: Loop: 120#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 116#L13 assume !(0 == __VERIFIER_assert_~cond#1); 113#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 122#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 123#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 120#L22-3 [2021-11-13 17:39:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-11-13 17:39:44,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:39:44,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62436088] [2021-11-13 17:39:44,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:44,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:39:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:39:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:39:44,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:39:44,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62436088] [2021-11-13 17:39:44,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62436088] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:39:44,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:39:44,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:39:44,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652823789] [2021-11-13 17:39:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:39:44,179 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 17:39:44,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:44,183 INFO L85 PathProgramCache]: Analyzing trace with hash 51750045, now seen corresponding path program 1 times [2021-11-13 17:39:44,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:39:44,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422285062] [2021-11-13 17:39:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:44,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:39:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:44,210 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:39:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:44,225 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:39:44,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:39:44,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 17:39:44,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 17:39:44,437 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 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-11-13 17:39:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:39:44,472 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2021-11-13 17:39:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:39:44,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2021-11-13 17:39:44,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-13 17:39:44,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2021-11-13 17:39:44,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-13 17:39:44,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-13 17:39:44,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2021-11-13 17:39:44,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 17:39:44,480 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-11-13 17:39:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2021-11-13 17:39:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2021-11-13 17:39:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:39:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-11-13 17:39:44,487 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-11-13 17:39:44,487 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-11-13 17:39:44,487 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-13 17:39:44,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2021-11-13 17:39:44,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-13 17:39:44,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 17:39:44,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 17:39:44,493 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:39:44,493 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-13 17:39:44,493 INFO L791 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#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(24); 150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post3#1, main_#t~mem5#1, main_#t~post4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 155#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 153#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 154#L18-3 assume !(main_~i~0#1 < 100000); 156#L18-4 main_~i~0#1 := 0; 157#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 163#L13 assume !(0 == __VERIFIER_assert_~cond#1); 162#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 158#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 159#L22-2 [2021-11-13 17:39:44,493 INFO L793 eck$LassoCheckResult]: Loop: 159#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 161#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 151#L13 assume !(0 == __VERIFIER_assert_~cond#1); 152#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 160#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 159#L22-2 [2021-11-13 17:39:44,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1436006135, now seen corresponding path program 1 times [2021-11-13 17:39:44,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:39:44,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313344436] [2021-11-13 17:39:44,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:44,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:39:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:39:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:39:44,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:39:44,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313344436] [2021-11-13 17:39:44,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313344436] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:39:44,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684045243] [2021-11-13 17:39:44,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:44,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:39:44,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:39:44,567 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:39:44,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-13 17:39:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:39:44,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-13 17:39:44,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:39:44,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-13 17:39:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:39:44,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:39:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:39:44,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684045243] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:39:44,738 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:39:44,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-13 17:39:44,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96857811] [2021-11-13 17:39:44,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:39:44,739 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 17:39:44,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:44,739 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 2 times [2021-11-13 17:39:44,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:39:44,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810797894] [2021-11-13 17:39:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:44,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:39:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:44,763 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:39:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:44,776 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:39:44,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:39:44,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:39:44,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:39:44,936 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:39:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:39:45,010 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2021-11-13 17:39:45,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 17:39:45,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2021-11-13 17:39:45,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-13 17:39:45,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 36 transitions. [2021-11-13 17:39:45,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-11-13 17:39:45,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-11-13 17:39:45,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 36 transitions. [2021-11-13 17:39:45,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 17:39:45,015 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-11-13 17:39:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 36 transitions. [2021-11-13 17:39:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2021-11-13 17:39:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 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-11-13 17:39:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-11-13 17:39:45,018 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-11-13 17:39:45,018 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-11-13 17:39:45,018 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-13 17:39:45,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2021-11-13 17:39:45,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-13 17:39:45,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 17:39:45,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 17:39:45,021 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-11-13 17:39:45,021 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-13 17:39:45,021 INFO L791 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#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(24); 264#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post3#1, main_#t~mem5#1, main_#t~post4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 267#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 268#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 269#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 265#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 266#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 279#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 278#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 277#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 276#L18-3 assume !(main_~i~0#1 < 100000); 270#L18-4 main_~i~0#1 := 0; 271#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 282#L13 assume !(0 == __VERIFIER_assert_~cond#1); 280#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 281#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 283#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 284#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 286#L13 assume !(0 == __VERIFIER_assert_~cond#1); 285#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 272#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 273#L22-2 [2021-11-13 17:39:45,021 INFO L793 eck$LassoCheckResult]: Loop: 273#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 275#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 261#L13 assume !(0 == __VERIFIER_assert_~cond#1); 262#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 274#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 273#L22-2 [2021-11-13 17:39:45,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:45,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1930352971, now seen corresponding path program 1 times [2021-11-13 17:39:45,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:39:45,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119254280] [2021-11-13 17:39:45,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:45,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:39:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:39:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 17:39:45,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:39:45,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119254280] [2021-11-13 17:39:45,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119254280] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:39:45,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164314051] [2021-11-13 17:39:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:45,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:39:45,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:39:45,087 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:39:45,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-13 17:39:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:39:45,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-13 17:39:45,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:39:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 17:39:45,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:39:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 17:39:45,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164314051] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:39:45,307 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:39:45,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-11-13 17:39:45,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086584025] [2021-11-13 17:39:45,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:39:45,309 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 17:39:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:45,309 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 3 times [2021-11-13 17:39:45,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:39:45,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385629113] [2021-11-13 17:39:45,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:45,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:39:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:45,316 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:39:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:45,324 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:39:45,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:39:45,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-13 17:39:45,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-13 17:39:45,491 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-11-13 17:39:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:39:45,630 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2021-11-13 17:39:45,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-13 17:39:45,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 81 transitions. [2021-11-13 17:39:45,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2021-11-13 17:39:45,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 81 transitions. [2021-11-13 17:39:45,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2021-11-13 17:39:45,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2021-11-13 17:39:45,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 81 transitions. [2021-11-13 17:39:45,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 17:39:45,646 INFO L681 BuchiCegarLoop]: Abstraction has 75 states and 81 transitions. [2021-11-13 17:39:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 81 transitions. [2021-11-13 17:39:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2021-11-13 17:39:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 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-11-13 17:39:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2021-11-13 17:39:45,656 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-11-13 17:39:45,656 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-11-13 17:39:45,656 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-13 17:39:45,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 55 transitions. [2021-11-13 17:39:45,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-13 17:39:45,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 17:39:45,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 17:39:45,664 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2021-11-13 17:39:45,665 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-13 17:39:45,665 INFO L791 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#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(24); 499#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post3#1, main_#t~mem5#1, main_#t~post4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 504#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 505#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 506#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 502#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 503#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 529#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 528#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 527#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 526#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 525#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 524#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 523#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 522#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 521#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 520#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 519#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 518#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 517#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 516#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 515#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 514#L18-3 assume !(main_~i~0#1 < 100000); 507#L18-4 main_~i~0#1 := 0; 508#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 512#L13 assume !(0 == __VERIFIER_assert_~cond#1); 550#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 549#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 533#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 534#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 500#L13 assume !(0 == __VERIFIER_assert_~cond#1); 501#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 511#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 535#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 548#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 547#L13 assume !(0 == __VERIFIER_assert_~cond#1); 546#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 545#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 544#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 543#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 542#L13 assume !(0 == __VERIFIER_assert_~cond#1); 541#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 540#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 539#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 538#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 537#L13 assume !(0 == __VERIFIER_assert_~cond#1); 536#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 509#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 510#L22-2 [2021-11-13 17:39:45,666 INFO L793 eck$LassoCheckResult]: Loop: 510#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 513#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 532#L13 assume !(0 == __VERIFIER_assert_~cond#1); 531#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 530#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 510#L22-2 [2021-11-13 17:39:45,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1653685129, now seen corresponding path program 2 times [2021-11-13 17:39:45,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:39:45,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862756885] [2021-11-13 17:39:45,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:45,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:39:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:39:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-13 17:39:45,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:39:45,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862756885] [2021-11-13 17:39:45,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862756885] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:39:45,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732463765] [2021-11-13 17:39:45,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-13 17:39:45,878 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:39:45,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:39:45,880 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:39:45,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-13 17:39:45,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-13 17:39:45,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:39:45,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-13 17:39:45,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:39:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-13 17:39:46,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:39:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-13 17:39:46,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732463765] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:39:46,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:39:46,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2021-11-13 17:39:46,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228911565] [2021-11-13 17:39:46,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:39:46,435 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 17:39:46,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:46,435 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 4 times [2021-11-13 17:39:46,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:39:46,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325518635] [2021-11-13 17:39:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:46,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:39:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:46,442 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:39:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:46,449 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:39:46,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:39:46,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-13 17:39:46,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2021-11-13 17:39:46,584 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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-11-13 17:39:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:39:46,913 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2021-11-13 17:39:46,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-13 17:39:46,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2021-11-13 17:39:46,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2021-11-13 17:39:46,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 171 transitions. [2021-11-13 17:39:46,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2021-11-13 17:39:46,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2021-11-13 17:39:46,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 171 transitions. [2021-11-13 17:39:46,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 17:39:46,943 INFO L681 BuchiCegarLoop]: Abstraction has 159 states and 171 transitions. [2021-11-13 17:39:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 171 transitions. [2021-11-13 17:39:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 107. [2021-11-13 17:39:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 106 states have internal predecessors, (109), 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-11-13 17:39:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2021-11-13 17:39:46,953 INFO L704 BuchiCegarLoop]: Abstraction has 107 states and 109 transitions. [2021-11-13 17:39:46,953 INFO L587 BuchiCegarLoop]: Abstraction has 107 states and 109 transitions. [2021-11-13 17:39:46,953 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-13 17:39:46,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 109 transitions. [2021-11-13 17:39:46,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-11-13 17:39:46,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 17:39:46,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 17:39:46,959 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 11, 11, 11, 11, 10, 1, 1, 1, 1] [2021-11-13 17:39:46,960 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-11-13 17:39:46,960 INFO L791 eck$LassoCheckResult]: Stem: 1020#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#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(24); 1021#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post3#1, main_#t~mem5#1, main_#t~post4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1026#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1027#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1028#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1024#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1025#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1075#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1074#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1073#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1072#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1071#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1070#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1069#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1068#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1067#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1066#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1065#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1064#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1063#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1062#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1061#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1060#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1059#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1058#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1057#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1056#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1055#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1054#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1053#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1052#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1051#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1050#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1049#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1048#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1047#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1046#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1045#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1044#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1043#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1042#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1041#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1040#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1039#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1038#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1037#L18-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1036#L18-3 assume !(main_~i~0#1 < 100000); 1029#L18-4 main_~i~0#1 := 0; 1030#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1034#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1126#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 1125#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1079#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1080#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1022#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1023#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 1033#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1081#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1124#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1123#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1122#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 1121#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1120#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1119#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1118#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1117#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 1116#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1115#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1114#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1113#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1112#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 1111#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1110#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1109#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1108#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1107#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 1106#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1105#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1104#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1103#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1102#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 1101#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1100#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1099#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1098#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1097#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 1096#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1095#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1094#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1093#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1092#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 1091#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1090#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1089#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1088#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1087#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 1086#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1085#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1084#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1083#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1082#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 1031#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1032#L22-2 [2021-11-13 17:39:46,961 INFO L793 eck$LassoCheckResult]: Loop: 1032#L22-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1035#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem5#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1078#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1077#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1; 1076#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1032#L22-2 [2021-11-13 17:39:46,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1459869857, now seen corresponding path program 3 times [2021-11-13 17:39:46,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:39:46,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3414262] [2021-11-13 17:39:46,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:46,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:39:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:39:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2021-11-13 17:39:47,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:39:47,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3414262] [2021-11-13 17:39:47,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3414262] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:39:47,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949949923] [2021-11-13 17:39:47,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-13 17:39:47,450 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:39:47,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:39:47,452 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:39:47,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-13 17:39:47,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-13 17:39:47,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:39:47,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-13 17:39:47,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:39:47,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-13 17:39:47,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2021-11-13 17:39:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2021-11-13 17:39:47,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 17:39:47,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949949923] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:39:47,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:39:47,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 28 [2021-11-13 17:39:47,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376654068] [2021-11-13 17:39:47,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:39:47,838 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 17:39:47,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:39:47,839 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 5 times [2021-11-13 17:39:47,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:39:47,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010865688] [2021-11-13 17:39:47,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:39:47,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:39:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:47,848 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:39:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:39:47,863 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:39:48,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:39:48,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 17:39:48,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2021-11-13 17:39:48,004 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:39:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:39:48,045 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2021-11-13 17:39:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:39:48,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 55 transitions. [2021-11-13 17:39:48,047 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-11-13 17:39:48,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2021-11-13 17:39:48,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-11-13 17:39:48,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-11-13 17:39:48,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-11-13 17:39:48,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 17:39:48,048 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 17:39:48,048 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 17:39:48,048 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 17:39:48,048 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-13 17:39:48,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-11-13 17:39:48,048 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-11-13 17:39:48,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-11-13 17:39:48,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 05:39:48 BoogieIcfgContainer [2021-11-13 17:39:48,056 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-11-13 17:39:48,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 17:39:48,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 17:39:48,057 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 17:39:48,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:39:41" (3/4) ... [2021-11-13 17:39:48,060 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-13 17:39:48,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 17:39:48,070 INFO L158 Benchmark]: Toolchain (without parser) took 7112.51ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 96.0MB in the beginning and 55.6MB in the end (delta: 40.4MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2021-11-13 17:39:48,071 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 83.9MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 17:39:48,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.89ms. Allocated memory is still 123.7MB. Free memory was 95.7MB in the beginning and 86.4MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-13 17:39:48,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.77ms. Allocated memory is still 123.7MB. Free memory was 86.1MB in the beginning and 84.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 17:39:48,073 INFO L158 Benchmark]: Boogie Preprocessor took 35.25ms. Allocated memory is still 123.7MB. Free memory was 84.6MB in the beginning and 83.8MB in the end (delta: 868.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 17:39:48,073 INFO L158 Benchmark]: RCFGBuilder took 361.84ms. Allocated memory is still 123.7MB. Free memory was 83.5MB in the beginning and 73.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-13 17:39:48,076 INFO L158 Benchmark]: BuchiAutomizer took 6425.93ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 73.6MB in the beginning and 55.6MB in the end (delta: 18.0MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2021-11-13 17:39:48,077 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 153.1MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 17:39:48,079 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.35ms. Allocated memory is still 83.9MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.89ms. Allocated memory is still 123.7MB. Free memory was 95.7MB in the beginning and 86.4MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.77ms. Allocated memory is still 123.7MB. Free memory was 86.1MB in the beginning and 84.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.25ms. Allocated memory is still 123.7MB. Free memory was 84.6MB in the beginning and 83.8MB in the end (delta: 868.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 361.84ms. Allocated memory is still 123.7MB. Free memory was 83.5MB in the beginning and 73.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 6425.93ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 73.6MB in the beginning and 55.6MB in the end (delta: 18.0MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 153.1MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 199999 * unknown-#length-unknown[a] + -8 * i and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 7 iterations. TraceHistogramMax:22. Analysis of lassos took 5.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 83 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 107 states and ocurred in iteration 5. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 484 SdHoareTripleChecker+Valid, 463.33ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 483 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 356.91ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 39 mSDtfsCounter, 252 mSolverCounterSat, 19.08ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital153 mio100 ax100 hnf100 lsp94 ukn59 mio100 lsp47 div100 bol100 ite100 ukn100 eq163 hnf92 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 51ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-11-13 17:39:48,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-13 17:39:48,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-13 17:39:48,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-13 17:39:48,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-13 17:39:48,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58dcde5e-1833-458b-adb1-59cbaa249184/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE