./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-regression/test25-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/test25-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY --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 de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 07:46:02,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 07:46:02,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 07:46:02,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 07:46:02,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 07:46:02,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 07:46:02,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 07:46:02,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 07:46:02,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 07:46:02,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 07:46:02,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 07:46:02,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 07:46:02,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 07:46:02,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 07:46:02,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 07:46:02,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 07:46:02,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 07:46:02,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 07:46:02,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 07:46:03,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 07:46:03,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 07:46:03,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 07:46:03,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 07:46:03,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 07:46:03,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 07:46:03,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 07:46:03,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 07:46:03,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 07:46:03,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 07:46:03,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 07:46:03,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 07:46:03,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 07:46:03,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 07:46:03,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 07:46:03,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 07:46:03,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 07:46:03,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 07:46:03,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 07:46:03,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 07:46:03,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 07:46:03,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 07:46:03,040 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-07 07:46:03,106 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 07:46:03,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 07:46:03,108 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 07:46:03,108 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 07:46:03,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 07:46:03,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 07:46:03,112 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 07:46:03,112 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-07 07:46:03,112 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-07 07:46:03,112 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-07 07:46:03,114 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-07 07:46:03,123 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-07 07:46:03,123 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-07 07:46:03,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 07:46:03,124 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 07:46:03,124 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 07:46:03,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 07:46:03,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 07:46:03,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 07:46:03,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-07 07:46:03,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-07 07:46:03,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-07 07:46:03,126 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 07:46:03,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 07:46:03,127 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-07 07:46:03,127 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 07:46:03,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-07 07:46:03,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 07:46:03,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 07:46:03,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 07:46:03,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 07:46:03,131 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 07:46:03,133 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-07 07:46:03,133 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_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/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_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY 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 -> de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 [2021-11-07 07:46:03,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 07:46:03,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 07:46:03,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 07:46:03,543 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 07:46:03,544 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 07:46:03,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/ldv-regression/test25-1.c [2021-11-07 07:46:03,632 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/data/184e8a0c3/98365d31bb6b47e283d51fcb2f126648/FLAGb06464fc9 [2021-11-07 07:46:04,197 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 07:46:04,198 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/sv-benchmarks/c/ldv-regression/test25-1.c [2021-11-07 07:46:04,214 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/data/184e8a0c3/98365d31bb6b47e283d51fcb2f126648/FLAGb06464fc9 [2021-11-07 07:46:04,503 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/data/184e8a0c3/98365d31bb6b47e283d51fcb2f126648 [2021-11-07 07:46:04,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 07:46:04,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 07:46:04,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 07:46:04,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 07:46:04,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 07:46:04,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:46:04" (1/1) ... [2021-11-07 07:46:04,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21df551a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:04, skipping insertion in model container [2021-11-07 07:46:04,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:46:04" (1/1) ... [2021-11-07 07:46:04,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 07:46:04,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 07:46:04,785 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_1ce86d03-66ff-4955-8c91-8ec417a4a59e/sv-benchmarks/c/ldv-regression/test25-1.c[936,949] [2021-11-07 07:46:04,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:46:04,797 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 07:46:04,820 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_1ce86d03-66ff-4955-8c91-8ec417a4a59e/sv-benchmarks/c/ldv-regression/test25-1.c[936,949] [2021-11-07 07:46:04,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:46:04,839 INFO L208 MainTranslator]: Completed translation [2021-11-07 07:46:04,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:04 WrapperNode [2021-11-07 07:46:04,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 07:46:04,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 07:46:04,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 07:46:04,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 07:46:04,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:04" (1/1) ... [2021-11-07 07:46:04,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:04" (1/1) ... [2021-11-07 07:46:04,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 07:46:04,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 07:46:04,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 07:46:04,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 07:46:04,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:04" (1/1) ... [2021-11-07 07:46:04,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:04" (1/1) ... [2021-11-07 07:46:04,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:04" (1/1) ... [2021-11-07 07:46:04,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:04" (1/1) ... [2021-11-07 07:46:04,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:04" (1/1) ... [2021-11-07 07:46:04,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:04" (1/1) ... [2021-11-07 07:46:04,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:04" (1/1) ... [2021-11-07 07:46:04,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 07:46:04,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 07:46:04,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 07:46:04,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 07:46:04,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:04" (1/1) ... [2021-11-07 07:46:04,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:04,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:04,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:04,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-07 07:46:05,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 07:46:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 07:46:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 07:46:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 07:46:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 07:46:05,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 07:46:05,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 07:46:05,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 07:46:05,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 07:46:05,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 07:46:05,483 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-11-07 07:46:05,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:05 BoogieIcfgContainer [2021-11-07 07:46:05,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 07:46:05,486 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-07 07:46:05,486 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-07 07:46:05,490 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-07 07:46:05,491 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 07:46:05,492 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 07:46:04" (1/3) ... [2021-11-07 07:46:05,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ce31996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 07:46:05, skipping insertion in model container [2021-11-07 07:46:05,493 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 07:46:05,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:04" (2/3) ... [2021-11-07 07:46:05,494 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ce31996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 07:46:05, skipping insertion in model container [2021-11-07 07:46:05,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 07:46:05,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:05" (3/3) ... [2021-11-07 07:46:05,496 INFO L389 chiAutomizerObserver]: Analyzing ICFG test25-1.c [2021-11-07 07:46:05,550 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-07 07:46:05,550 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-07 07:46:05,550 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-07 07:46:05,550 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-07 07:46:05,551 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-07 07:46:05,551 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-07 07:46:05,551 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-07 07:46:05,551 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-07 07:46:05,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-07 07:46:05,586 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-07 07:46:05,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:46:05,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:46:05,593 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-07 07:46:05,593 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:46:05,593 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-07 07:46:05,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-07 07:46:05,596 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-07 07:46:05,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:46:05,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:46:05,596 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-07 07:46:05,597 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:46:05,603 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~nondet11, main_#t~nondet12, main_#t~post10, main_~j~0, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16, main_#t~pre18, main_#t~mem17, main_#t~ret19, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~j~0 := 0; 14#L26-3true [2021-11-07 07:46:05,603 INFO L793 eck$LassoCheckResult]: Loop: 14#L26-3true assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 12#L26-2true main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 14#L26-3true [2021-11-07 07:46:05,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:05,610 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-11-07 07:46:05,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:05,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059768279] [2021-11-07 07:46:05,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:05,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:05,748 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:46:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:05,817 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:46:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-11-07 07:46:05,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:05,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611226697] [2021-11-07 07:46:05,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:05,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:05,838 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:46:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:05,861 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:46:05,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:05,872 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-11-07 07:46:05,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:05,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640061768] [2021-11-07 07:46:05,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:05,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:05,930 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:46:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:06,070 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:46:07,308 INFO L210 LassoAnalysis]: Preferences: [2021-11-07 07:46:07,309 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-07 07:46:07,309 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-07 07:46:07,309 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-07 07:46:07,309 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-07 07:46:07,310 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:07,310 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-07 07:46:07,310 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-07 07:46:07,310 INFO L133 ssoRankerPreferences]: Filename of dumped script: test25-1.c_Iteration1_Lasso [2021-11-07 07:46:07,311 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-07 07:46:07,311 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-07 07:46:07,335 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-07 07:46:07,341 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-07 07:46:07,346 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-07 07:46:07,349 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-07 07:46:07,352 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-07 07:46:07,355 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-07 07:46:07,359 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-07 07:46:07,363 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-07 07:46:07,366 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-07 07:46:07,613 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-07 07:46:07,618 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-07 07:46:07,621 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-07 07:46:07,625 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-07 07:46:07,629 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-07 07:46:07,633 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-07 07:46:07,636 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-07 07:46:07,641 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-07 07:46:07,644 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-07 07:46:07,647 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-07 07:46:07,652 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-07 07:46:07,655 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-07 07:46:08,075 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-07 07:46:08,079 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-07 07:46:08,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:08,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:08,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:08,104 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-07 07:46:08,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:08,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:46:08,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:08,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:08,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:08,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:46:08,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:46:08,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-07 07:46:08,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:08,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:08,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:08,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:08,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:08,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-07 07:46:08,182 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-07 07:46:08,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:08,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:08,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:08,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:08,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:46:08,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:46:08,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:08,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:08,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:08,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:08,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:08,279 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-07 07:46:08,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:08,290 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:46:08,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:08,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:08,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:08,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:46:08,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:46:08,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-07 07:46:08,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:08,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:08,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:08,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:08,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:08,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-07 07:46:08,342 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-07 07:46:08,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:08,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:08,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:08,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:08,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:46:08,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:46:08,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:08,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-11-07 07:46:08,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:08,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:08,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:08,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-07 07:46:08,397 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-07 07:46:08,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:08,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:46:08,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:08,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:08,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:08,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:46:08,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:46:08,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:08,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:08,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:08,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:08,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:08,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-07 07:46:08,454 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-07 07:46:08,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:08,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:08,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:08,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:08,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:46:08,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:46:08,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:08,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:08,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:08,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:08,506 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:08,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-07 07:46:08,515 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-07 07:46:08,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:08,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:08,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:08,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:08,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:46:08,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:46:08,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:08,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:08,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:08,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:08,607 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:08,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-07 07:46:08,622 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-07 07:46:08,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:08,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:46:08,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:08,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:08,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:08,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:46:08,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:46:08,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:08,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:08,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:08,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:08,674 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:08,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-07 07:46:08,676 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-07 07:46:08,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:08,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:46:08,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:08,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:08,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:08,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:46:08,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:46:08,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:08,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:08,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:08,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:08,747 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:08,750 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-07 07:46:08,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-11-07 07:46:08,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:08,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:08,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:08,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:08,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:46:08,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:46:08,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:08,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:08,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:08,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:08,822 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:08,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-11-07 07:46:08,824 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-07 07:46:08,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:08,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-07 07:46:08,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:08,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:08,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:08,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-07 07:46:08,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-07 07:46:08,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:08,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:08,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:08,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:08,892 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:08,899 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-07 07:46:08,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:08,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:08,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:08,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:08,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:46:08,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:46:08,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-11-07 07:46:08,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:08,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:08,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:08,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:08,983 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:08,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-11-07 07:46:08,990 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-07 07:46:09,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:09,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:09,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:09,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:09,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:46:09,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:46:09,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:09,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:09,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:09,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:09,051 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:09,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-11-07 07:46:09,057 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-07 07:46:09,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:09,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:09,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:09,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:09,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:46:09,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:46:09,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:09,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:09,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:09,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:09,140 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:09,150 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-07 07:46:09,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-11-07 07:46:09,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:09,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:09,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:09,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:09,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:46:09,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:46:09,172 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-07 07:46:09,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:09,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:09,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:09,200 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:09,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-11-07 07:46:09,203 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-07 07:46:09,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-07 07:46:09,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-07 07:46:09,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-07 07:46:09,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-07 07:46:09,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-07 07:46:09,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-07 07:46:09,232 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-07 07:46:09,268 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-11-07 07:46:09,268 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-11-07 07:46:09,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 07:46:09,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:09,281 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 07:46:09,306 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-07 07:46:09,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-11-07 07:46:09,328 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-07 07:46:09,329 INFO L513 LassoAnalysis]: Proved termination. [2021-11-07 07:46:09,329 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#array~0.base)_1, ULTIMATE.start_main_~j~0) = 19*v_rep(select #length ULTIMATE.start_main_~#array~0.base)_1 - 16*ULTIMATE.start_main_~j~0 Supporting invariants [] [2021-11-07 07:46:09,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:09,570 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2021-11-07 07:46:09,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-11-07 07:46:09,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:09,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 07:46:09,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:46:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:09,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 07:46:09,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:46:09,722 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-07 07:46:09,743 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-07 07:46:09,745 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-07 07:46:09,830 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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 39 states and 56 transitions. Complement of second has 8 states. [2021-11-07 07:46:09,830 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-07 07:46:09,832 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-07 07:46:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2021-11-07 07:46:09,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 2 letters. [2021-11-07 07:46:09,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 07:46:09,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2021-11-07 07:46:09,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 07:46:09,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 4 letters. [2021-11-07 07:46:09,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-07 07:46:09,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 56 transitions. [2021-11-07 07:46:09,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:09,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 9 states and 11 transitions. [2021-11-07 07:46:09,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-11-07 07:46:09,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-11-07 07:46:09,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2021-11-07 07:46:09,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:46:09,847 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-11-07 07:46:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2021-11-07 07:46:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-11-07 07:46:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-07 07:46:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2021-11-07 07:46:09,872 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-11-07 07:46:09,873 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2021-11-07 07:46:09,873 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-07 07:46:09,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2021-11-07 07:46:09,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:09,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:46:09,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:46:09,874 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-07 07:46:09,874 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:46:09,875 INFO L791 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 160#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet11, main_#t~nondet12, main_#t~post10, main_~j~0, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16, main_#t~pre18, main_#t~mem17, main_#t~ret19, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~j~0 := 0; 167#L26-3 assume !(main_~j~0 < 10); 163#L26-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem13.base, 4 + main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15 := read~int(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4); 161#L34 assume main_#t~mem15 > 0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem16 - 10;havoc main_#t~mem16; 162#L36-3 [2021-11-07 07:46:09,875 INFO L793 eck$LassoCheckResult]: Loop: 162#L36-3 call main_#t~mem17 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 166#L36-1 assume !!(main_~i~0 < main_#t~mem17);havoc main_#t~mem17;main_#t~pre18 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre18; 162#L36-3 [2021-11-07 07:46:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:09,876 INFO L85 PathProgramCache]: Analyzing trace with hash 28697000, now seen corresponding path program 1 times [2021-11-07 07:46:09,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:09,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814517458] [2021-11-07 07:46:09,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:09,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:09,934 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-07 07:46:09,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:46:09,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814517458] [2021-11-07 07:46:09,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814517458] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:46:09,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:46:09,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 07:46:09,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506898352] [2021-11-07 07:46:09,939 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:46:09,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2021-11-07 07:46:09,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:09,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123323576] [2021-11-07 07:46:09,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:09,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:09,948 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:46:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:09,955 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:46:09,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:46:09,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 07:46:09,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 07:46:09,999 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-07 07:46:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:46:10,016 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2021-11-07 07:46:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 07:46:10,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2021-11-07 07:46:10,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:10,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2021-11-07 07:46:10,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-11-07 07:46:10,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-11-07 07:46:10,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2021-11-07 07:46:10,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:46:10,020 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-11-07 07:46:10,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2021-11-07 07:46:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2021-11-07 07:46:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:46:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-11-07 07:46:10,022 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-11-07 07:46:10,022 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-11-07 07:46:10,022 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-07 07:46:10,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2021-11-07 07:46:10,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:10,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:46:10,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:46:10,023 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:46:10,023 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:46:10,024 INFO L791 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 185#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet11, main_#t~nondet12, main_#t~post10, main_~j~0, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16, main_#t~pre18, main_#t~mem17, main_#t~ret19, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~j~0 := 0; 192#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 188#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 189#L26-3 assume !(main_~j~0 < 10); 190#L26-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem13.base, 4 + main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15 := read~int(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4); 186#L34 assume main_#t~mem15 > 0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem16 - 10;havoc main_#t~mem16; 187#L36-3 [2021-11-07 07:46:10,024 INFO L793 eck$LassoCheckResult]: Loop: 187#L36-3 call main_#t~mem17 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 191#L36-1 assume !!(main_~i~0 < main_#t~mem17);havoc main_#t~mem17;main_#t~pre18 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre18; 187#L36-3 [2021-11-07 07:46:10,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:10,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669606, now seen corresponding path program 1 times [2021-11-07 07:46:10,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:10,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831952624] [2021-11-07 07:46:10,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:10,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:10,081 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-07 07:46:10,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:46:10,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831952624] [2021-11-07 07:46:10,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831952624] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:10,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569823337] [2021-11-07 07:46:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:10,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:46:10,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:10,090 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:46:10,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-07 07:46:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:10,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 07:46:10,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:46:10,217 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-07 07:46:10,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569823337] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:10,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:46:10,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-11-07 07:46:10,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343090833] [2021-11-07 07:46:10,219 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:46:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2021-11-07 07:46:10,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:10,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363198813] [2021-11-07 07:46:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:10,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:10,234 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:46:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:10,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:46:10,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:46:10,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 07:46:10,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:46:10,287 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:46:10,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:46:10,314 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2021-11-07 07:46:10,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:46:10,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2021-11-07 07:46:10,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:10,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2021-11-07 07:46:10,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-11-07 07:46:10,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-11-07 07:46:10,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2021-11-07 07:46:10,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:46:10,318 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-11-07 07:46:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2021-11-07 07:46:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2021-11-07 07:46:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:46:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-11-07 07:46:10,320 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-11-07 07:46:10,320 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-11-07 07:46:10,320 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-07 07:46:10,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2021-11-07 07:46:10,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:10,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:46:10,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:46:10,322 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2021-11-07 07:46:10,322 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:46:10,322 INFO L791 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 232#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet11, main_#t~nondet12, main_#t~post10, main_~j~0, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16, main_#t~pre18, main_#t~mem17, main_#t~ret19, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~j~0 := 0; 239#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 235#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 236#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 240#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 241#L26-3 assume !(main_~j~0 < 10); 237#L26-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem13.base, 4 + main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15 := read~int(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4); 233#L34 assume main_#t~mem15 > 0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem16 - 10;havoc main_#t~mem16; 234#L36-3 [2021-11-07 07:46:10,322 INFO L793 eck$LassoCheckResult]: Loop: 234#L36-3 call main_#t~mem17 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 238#L36-1 assume !!(main_~i~0 < main_#t~mem17);havoc main_#t~mem17;main_#t~pre18 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre18; 234#L36-3 [2021-11-07 07:46:10,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:10,323 INFO L85 PathProgramCache]: Analyzing trace with hash -367607132, now seen corresponding path program 2 times [2021-11-07 07:46:10,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:10,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953786963] [2021-11-07 07:46:10,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:10,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:10,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:46:10,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953786963] [2021-11-07 07:46:10,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953786963] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:10,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214656549] [2021-11-07 07:46:10,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 07:46:10,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:46:10,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:10,441 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:46:10,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-07 07:46:10,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 07:46:10,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:46:10,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 07:46:10,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:46:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:10,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214656549] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:10,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:46:10,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-11-07 07:46:10,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912520736] [2021-11-07 07:46:10,569 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:46:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 3 times [2021-11-07 07:46:10,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:10,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869443169] [2021-11-07 07:46:10,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:10,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:10,576 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:46:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:10,582 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:46:10,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:46:10,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 07:46:10,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-07 07:46:10,624 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:46:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:46:10,655 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2021-11-07 07:46:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 07:46:10,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2021-11-07 07:46:10,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:10,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2021-11-07 07:46:10,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-11-07 07:46:10,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-11-07 07:46:10,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2021-11-07 07:46:10,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:46:10,660 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-11-07 07:46:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2021-11-07 07:46:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-11-07 07:46:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:46:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-11-07 07:46:10,662 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-11-07 07:46:10,663 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-11-07 07:46:10,663 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-07 07:46:10,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2021-11-07 07:46:10,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:10,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:46:10,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:46:10,664 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2021-11-07 07:46:10,665 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:46:10,665 INFO L791 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 290#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet11, main_#t~nondet12, main_#t~post10, main_~j~0, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16, main_#t~pre18, main_#t~mem17, main_#t~ret19, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~j~0 := 0; 297#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 293#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 294#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 301#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 298#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 299#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 300#L26-3 assume !(main_~j~0 < 10); 295#L26-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem13.base, 4 + main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15 := read~int(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4); 291#L34 assume main_#t~mem15 > 0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem16 - 10;havoc main_#t~mem16; 292#L36-3 [2021-11-07 07:46:10,665 INFO L793 eck$LassoCheckResult]: Loop: 292#L36-3 call main_#t~mem17 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 296#L36-1 assume !!(main_~i~0 < main_#t~mem17);havoc main_#t~mem17;main_#t~pre18 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre18; 292#L36-3 [2021-11-07 07:46:10,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1081479198, now seen corresponding path program 3 times [2021-11-07 07:46:10,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:10,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200217061] [2021-11-07 07:46:10,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:10,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:10,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:46:10,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200217061] [2021-11-07 07:46:10,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200217061] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:10,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013484939] [2021-11-07 07:46:10,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 07:46:10,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:46:10,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:10,805 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:46:10,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-07 07:46:10,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-07 07:46:10,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:46:10,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 07:46:10,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:46:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:10,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013484939] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:10,972 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:46:10,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-11-07 07:46:10,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920636831] [2021-11-07 07:46:10,974 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:46:10,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:10,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 4 times [2021-11-07 07:46:10,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:10,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577553455] [2021-11-07 07:46:10,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:10,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:10,981 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:46:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:10,989 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:46:11,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:46:11,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 07:46:11,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-07 07:46:11,029 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:46:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:46:11,073 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2021-11-07 07:46:11,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 07:46:11,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2021-11-07 07:46:11,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:11,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2021-11-07 07:46:11,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-11-07 07:46:11,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-11-07 07:46:11,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2021-11-07 07:46:11,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:46:11,078 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-11-07 07:46:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2021-11-07 07:46:11,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2021-11-07 07:46:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 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-07 07:46:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-11-07 07:46:11,081 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-11-07 07:46:11,081 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-11-07 07:46:11,081 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-07 07:46:11,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2021-11-07 07:46:11,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:11,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:46:11,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:46:11,083 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2021-11-07 07:46:11,083 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:46:11,084 INFO L791 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 359#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet11, main_#t~nondet12, main_#t~post10, main_~j~0, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16, main_#t~pre18, main_#t~mem17, main_#t~ret19, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~j~0 := 0; 366#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 367#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 368#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 363#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 364#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 372#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 371#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 370#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 369#L26-3 assume !(main_~j~0 < 10); 362#L26-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem13.base, 4 + main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15 := read~int(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4); 360#L34 assume main_#t~mem15 > 0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem16 - 10;havoc main_#t~mem16; 361#L36-3 [2021-11-07 07:46:11,084 INFO L793 eck$LassoCheckResult]: Loop: 361#L36-3 call main_#t~mem17 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 365#L36-1 assume !!(main_~i~0 < main_#t~mem17);havoc main_#t~mem17;main_#t~pre18 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre18; 361#L36-3 [2021-11-07 07:46:11,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:11,085 INFO L85 PathProgramCache]: Analyzing trace with hash 82232736, now seen corresponding path program 4 times [2021-11-07 07:46:11,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:11,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939042877] [2021-11-07 07:46:11,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:11,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:11,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:46:11,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939042877] [2021-11-07 07:46:11,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939042877] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:11,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595544013] [2021-11-07 07:46:11,194 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 07:46:11,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:46:11,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:11,197 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:46:11,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-07 07:46:11,790 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 07:46:11,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:46:11,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 07:46:11,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:46:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:11,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595544013] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:11,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:46:11,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-11-07 07:46:11,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230749265] [2021-11-07 07:46:11,855 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:46:11,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 5 times [2021-11-07 07:46:11,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:11,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773787936] [2021-11-07 07:46:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:11,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:11,860 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:46:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:11,866 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:46:11,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:46:11,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 07:46:11,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-11-07 07:46:11,914 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-07 07:46:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:46:11,956 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2021-11-07 07:46:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 07:46:11,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2021-11-07 07:46:11,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:11,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2021-11-07 07:46:11,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-11-07 07:46:11,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-11-07 07:46:11,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2021-11-07 07:46:11,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:46:11,960 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2021-11-07 07:46:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2021-11-07 07:46:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-11-07 07:46:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:46:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-11-07 07:46:11,962 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-11-07 07:46:11,962 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-11-07 07:46:11,963 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-07 07:46:11,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2021-11-07 07:46:11,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:11,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:46:11,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:46:11,964 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2021-11-07 07:46:11,964 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:46:11,965 INFO L791 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 439#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet11, main_#t~nondet12, main_#t~post10, main_~j~0, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16, main_#t~pre18, main_#t~mem17, main_#t~ret19, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~j~0 := 0; 446#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 447#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 448#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 442#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 443#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 454#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 453#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 452#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 451#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 450#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 449#L26-3 assume !(main_~j~0 < 10); 444#L26-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem13.base, 4 + main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15 := read~int(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4); 440#L34 assume main_#t~mem15 > 0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem16 - 10;havoc main_#t~mem16; 441#L36-3 [2021-11-07 07:46:11,965 INFO L793 eck$LassoCheckResult]: Loop: 441#L36-3 call main_#t~mem17 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 445#L36-1 assume !!(main_~i~0 < main_#t~mem17);havoc main_#t~mem17;main_#t~pre18 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre18; 441#L36-3 [2021-11-07 07:46:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:11,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1717904350, now seen corresponding path program 5 times [2021-11-07 07:46:11,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:11,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045625498] [2021-11-07 07:46:11,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:11,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:12,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:46:12,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045625498] [2021-11-07 07:46:12,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045625498] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:12,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518472828] [2021-11-07 07:46:12,057 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-07 07:46:12,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:46:12,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:12,062 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:46:12,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-07 07:46:13,297 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-11-07 07:46:13,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:46:13,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 07:46:13,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:46:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:13,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518472828] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:13,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:46:13,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-11-07 07:46:13,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573091289] [2021-11-07 07:46:13,379 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:46:13,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:13,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 6 times [2021-11-07 07:46:13,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:13,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426315119] [2021-11-07 07:46:13,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:13,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:13,386 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:46:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:13,401 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:46:13,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:46:13,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 07:46:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-11-07 07:46:13,442 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:46:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:46:13,486 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-11-07 07:46:13,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 07:46:13,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 21 transitions. [2021-11-07 07:46:13,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:13,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 21 transitions. [2021-11-07 07:46:13,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-11-07 07:46:13,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-11-07 07:46:13,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2021-11-07 07:46:13,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:46:13,490 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-11-07 07:46:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2021-11-07 07:46:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-11-07 07:46:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 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-07 07:46:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-11-07 07:46:13,493 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-11-07 07:46:13,493 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-11-07 07:46:13,493 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-07 07:46:13,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2021-11-07 07:46:13,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:13,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:46:13,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:46:13,495 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2021-11-07 07:46:13,495 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:46:13,495 INFO L791 eck$LassoCheckResult]: Stem: 529#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 530#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet11, main_#t~nondet12, main_#t~post10, main_~j~0, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16, main_#t~pre18, main_#t~mem17, main_#t~ret19, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~j~0 := 0; 537#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 538#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 539#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 533#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 534#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 547#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 546#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 545#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 544#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 543#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 542#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 541#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 540#L26-3 assume !(main_~j~0 < 10); 535#L26-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem13.base, 4 + main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15 := read~int(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4); 531#L34 assume main_#t~mem15 > 0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem16 - 10;havoc main_#t~mem16; 532#L36-3 [2021-11-07 07:46:13,495 INFO L793 eck$LassoCheckResult]: Loop: 532#L36-3 call main_#t~mem17 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 536#L36-1 assume !!(main_~i~0 < main_#t~mem17);havoc main_#t~mem17;main_#t~pre18 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre18; 532#L36-3 [2021-11-07 07:46:13,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1640295068, now seen corresponding path program 6 times [2021-11-07 07:46:13,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:13,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323168957] [2021-11-07 07:46:13,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:13,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:13,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:46:13,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323168957] [2021-11-07 07:46:13,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323168957] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:13,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821700289] [2021-11-07 07:46:13,634 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-07 07:46:13,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:46:13,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:13,637 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:46:13,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-07 07:46:14,324 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-11-07 07:46:14,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:46:14,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 07:46:14,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:46:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:14,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821700289] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:14,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:46:14,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-11-07 07:46:14,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817668610] [2021-11-07 07:46:14,432 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:46:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 7 times [2021-11-07 07:46:14,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:14,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733221317] [2021-11-07 07:46:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:14,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:14,439 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:46:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:14,445 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:46:14,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:46:14,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 07:46:14,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-11-07 07:46:14,490 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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-07 07:46:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:46:14,545 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2021-11-07 07:46:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 07:46:14,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2021-11-07 07:46:14,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:14,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 23 transitions. [2021-11-07 07:46:14,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-11-07 07:46:14,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-11-07 07:46:14,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2021-11-07 07:46:14,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:46:14,558 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-11-07 07:46:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2021-11-07 07:46:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-11-07 07:46:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 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-07 07:46:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-11-07 07:46:14,563 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-11-07 07:46:14,563 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-11-07 07:46:14,563 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-07 07:46:14,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2021-11-07 07:46:14,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:14,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:46:14,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:46:14,567 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2021-11-07 07:46:14,568 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:46:14,568 INFO L791 eck$LassoCheckResult]: Stem: 631#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 632#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet11, main_#t~nondet12, main_#t~post10, main_~j~0, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16, main_#t~pre18, main_#t~mem17, main_#t~ret19, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~j~0 := 0; 639#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 640#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 641#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 635#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 636#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 651#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 650#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 649#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 648#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 647#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 646#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 645#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 644#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 643#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 642#L26-3 assume !(main_~j~0 < 10); 637#L26-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem13.base, 4 + main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15 := read~int(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4); 633#L34 assume main_#t~mem15 > 0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem16 - 10;havoc main_#t~mem16; 634#L36-3 [2021-11-07 07:46:14,568 INFO L793 eck$LassoCheckResult]: Loop: 634#L36-3 call main_#t~mem17 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 638#L36-1 assume !!(main_~i~0 < main_#t~mem17);havoc main_#t~mem17;main_#t~pre18 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre18; 634#L36-3 [2021-11-07 07:46:14,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash 72219098, now seen corresponding path program 7 times [2021-11-07 07:46:14,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:14,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760505502] [2021-11-07 07:46:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:14,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:14,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:46:14,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760505502] [2021-11-07 07:46:14,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760505502] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:14,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989126545] [2021-11-07 07:46:14,736 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 07:46:14,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:46:14,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:14,739 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:46:14,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-07 07:46:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:14,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 07:46:14,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:46:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:14,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989126545] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:14,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:46:14,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-11-07 07:46:14,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717737396] [2021-11-07 07:46:14,964 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:46:14,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:14,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 8 times [2021-11-07 07:46:14,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:14,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953668679] [2021-11-07 07:46:14,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:14,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:14,976 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:46:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:14,981 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:46:15,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:46:15,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 07:46:15,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-11-07 07:46:15,025 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 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-07 07:46:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:46:15,090 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2021-11-07 07:46:15,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 07:46:15,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2021-11-07 07:46:15,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:15,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2021-11-07 07:46:15,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-11-07 07:46:15,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-11-07 07:46:15,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2021-11-07 07:46:15,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:46:15,097 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-11-07 07:46:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2021-11-07 07:46:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2021-11-07 07:46:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:46:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-11-07 07:46:15,099 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-11-07 07:46:15,099 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-11-07 07:46:15,099 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-07 07:46:15,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2021-11-07 07:46:15,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:15,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:46:15,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:46:15,101 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2021-11-07 07:46:15,101 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:46:15,103 INFO L791 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 745#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet11, main_#t~nondet12, main_#t~post10, main_~j~0, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16, main_#t~pre18, main_#t~mem17, main_#t~ret19, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~j~0 := 0; 752#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 753#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 754#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 748#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 749#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 766#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 765#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 764#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 763#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 762#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 761#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 760#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 759#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 758#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 757#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 756#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 755#L26-3 assume !(main_~j~0 < 10); 750#L26-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem13.base, 4 + main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15 := read~int(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4); 746#L34 assume main_#t~mem15 > 0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem16 - 10;havoc main_#t~mem16; 747#L36-3 [2021-11-07 07:46:15,104 INFO L793 eck$LassoCheckResult]: Loop: 747#L36-3 call main_#t~mem17 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 751#L36-1 assume !!(main_~i~0 < main_#t~mem17);havoc main_#t~mem17;main_#t~pre18 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre18; 747#L36-3 [2021-11-07 07:46:15,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:15,107 INFO L85 PathProgramCache]: Analyzing trace with hash 684732824, now seen corresponding path program 8 times [2021-11-07 07:46:15,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:15,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144142444] [2021-11-07 07:46:15,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:15,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:15,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:46:15,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144142444] [2021-11-07 07:46:15,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144142444] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:15,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263588460] [2021-11-07 07:46:15,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 07:46:15,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:46:15,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:15,279 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:46:15,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-07 07:46:15,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 07:46:15,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:46:15,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 07:46:15,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:46:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:15,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263588460] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:15,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:46:15,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-11-07 07:46:15,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212852089] [2021-11-07 07:46:15,517 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:46:15,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:15,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 9 times [2021-11-07 07:46:15,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:15,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456191397] [2021-11-07 07:46:15,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:15,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:15,522 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:46:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:15,526 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:46:15,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:46:15,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 07:46:15,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-11-07 07:46:15,602 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:46:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:46:15,665 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2021-11-07 07:46:15,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 07:46:15,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2021-11-07 07:46:15,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:15,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2021-11-07 07:46:15,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-11-07 07:46:15,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-11-07 07:46:15,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2021-11-07 07:46:15,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:46:15,669 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-11-07 07:46:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2021-11-07 07:46:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-11-07 07:46:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:46:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-11-07 07:46:15,672 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-11-07 07:46:15,672 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-11-07 07:46:15,672 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-07 07:46:15,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2021-11-07 07:46:15,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:46:15,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:46:15,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:46:15,674 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1] [2021-11-07 07:46:15,675 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:46:15,675 INFO L791 eck$LassoCheckResult]: Stem: 868#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 869#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet11, main_#t~nondet12, main_#t~post10, main_~j~0, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16, main_#t~pre18, main_#t~mem17, main_#t~ret19, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~j~0 := 0; 876#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 877#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 878#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 872#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 873#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 892#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 891#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 890#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 889#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 888#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 887#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 886#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 885#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 884#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 883#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 882#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 881#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 880#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 879#L26-3 assume !(main_~j~0 < 10); 874#L26-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem13.base, 4 + main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15 := read~int(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4); 870#L34 assume main_#t~mem15 > 0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem16 - 10;havoc main_#t~mem16; 871#L36-3 [2021-11-07 07:46:15,675 INFO L793 eck$LassoCheckResult]: Loop: 871#L36-3 call main_#t~mem17 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 875#L36-1 assume !!(main_~i~0 < main_#t~mem17);havoc main_#t~mem17;main_#t~pre18 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre18; 871#L36-3 [2021-11-07 07:46:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash 899903958, now seen corresponding path program 9 times [2021-11-07 07:46:15,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:15,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466521224] [2021-11-07 07:46:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:15,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:46:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:15,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:46:15,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466521224] [2021-11-07 07:46:15,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466521224] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:15,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464609279] [2021-11-07 07:46:15,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 07:46:15,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:46:15,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:46:15,813 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:46:15,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce86d03-66ff-4955-8c91-8ec417a4a59e/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-07 07:46:59,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-11-07 07:46:59,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:46:59,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-07 07:46:59,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:46:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:46:59,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464609279] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:46:59,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:46:59,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2021-11-07 07:46:59,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012222463] [2021-11-07 07:46:59,960 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 07:46:59,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:46:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 10 times [2021-11-07 07:46:59,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:46:59,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908306892] [2021-11-07 07:46:59,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:46:59,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:46:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:59,968 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:46:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:46:59,973 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:47:00,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:47:00,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 07:47:00,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-07 07:47:00,016 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:47:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:47:00,088 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2021-11-07 07:47:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 07:47:00,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2021-11-07 07:47:00,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:47:00,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2021-11-07 07:47:00,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-11-07 07:47:00,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-11-07 07:47:00,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2021-11-07 07:47:00,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 07:47:00,091 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-11-07 07:47:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2021-11-07 07:47:00,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-11-07 07:47:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 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-07 07:47:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-11-07 07:47:00,094 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-11-07 07:47:00,094 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-11-07 07:47:00,094 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-07 07:47:00,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2021-11-07 07:47:00,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-07 07:47:00,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 07:47:00,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 07:47:00,096 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1] [2021-11-07 07:47:00,096 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-07 07:47:00,096 INFO L791 eck$LassoCheckResult]: Stem: 1002#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1003#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~nondet11, main_#t~nondet12, main_#t~post10, main_~j~0, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15, main_#t~mem16, main_#t~pre18, main_#t~mem17, main_#t~ret19, main_~#cont~0.base, main_~#cont~0.offset, main_~#array~0.base, main_~#array~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;call main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.allocOnStack(4);call main_~#array~0.base, main_~#array~0.offset := #Ultimate.allocOnStack(80);havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~j~0 := 0; 1010#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 1011#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1012#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 1006#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1007#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 1028#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1027#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 1026#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1025#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 1024#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1023#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 1022#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1021#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 1020#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1019#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 1018#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1017#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 1016#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1015#L26-3 assume !!(main_~j~0 < 10);call write~int(main_#t~nondet11, main_~#array~0.base, main_~#array~0.offset + 8 * main_~j~0, 4);havoc main_#t~nondet11;call write~int(main_#t~nondet12, main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~j~0), 4);havoc main_#t~nondet12; 1014#L26-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1013#L26-3 assume !(main_~j~0 < 10); 1008#L26-4 assume main_~i~0 >= 0 && main_~i~0 < 9;call write~$Pointer$(main_~#array~0.base, main_~#array~0.offset + 8 * main_~i~0, main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);main_~pa~0.base, main_~pa~0.offset := main_#t~mem13.base, 4 + main_#t~mem13.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset, 4);call main_#t~mem15 := read~int(main_#t~mem14.base, 4 + main_#t~mem14.offset, 4); 1004#L34 assume main_#t~mem15 > 0;havoc main_#t~mem14.base, main_#t~mem14.offset;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~#array~0.base, 4 + (main_~#array~0.offset + 8 * main_~i~0), 4);main_~i~0 := main_#t~mem16 - 10;havoc main_#t~mem16; 1005#L36-3 [2021-11-07 07:47:00,096 INFO L793 eck$LassoCheckResult]: Loop: 1005#L36-3 call main_#t~mem17 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); 1009#L36-1 assume !!(main_~i~0 < main_#t~mem17);havoc main_#t~mem17;main_#t~pre18 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre18; 1005#L36-3 [2021-11-07 07:47:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:47:00,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1520933524, now seen corresponding path program 10 times [2021-11-07 07:47:00,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:47:00,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71477598] [2021-11-07 07:47:00,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:47:00,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:47:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:47:00,151 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:47:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:47:00,216 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:47:00,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:47:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 11 times [2021-11-07 07:47:00,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:47:00,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155132303] [2021-11-07 07:47:00,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:47:00,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:47:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:47:00,223 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:47:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:47:00,227 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:47:00,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:47:00,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1328236761, now seen corresponding path program 1 times [2021-11-07 07:47:00,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:47:00,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679032680] [2021-11-07 07:47:00,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:47:00,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:47:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:47:00,312 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:47:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:47:00,423 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace