./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/NO_13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/NO_13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c0d0ad10124da460587cca853afd7fd9944c9aa2 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:44:41,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:44:41,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:44:41,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:44:41,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:44:41,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:44:41,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:44:41,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:44:41,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:44:41,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:44:41,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:44:41,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:44:41,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:44:41,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:44:41,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:44:41,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:44:41,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:44:41,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:44:41,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:44:41,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:44:41,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:44:41,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:44:41,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:44:41,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:44:41,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:44:41,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:44:41,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:44:41,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:44:41,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:44:41,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:44:41,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:44:41,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:44:41,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:44:41,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:44:41,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:44:41,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:44:41,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:44:41,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:44:41,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:44:41,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:44:41,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:44:41,560 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-11-30 00:44:41,592 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:44:41,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:44:41,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:44:41,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:44:41,594 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:44:41,595 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 00:44:41,595 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 00:44:41,595 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 00:44:41,595 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 00:44:41,596 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 00:44:41,596 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 00:44:41,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:44:41,596 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:44:41,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:44:41,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:44:41,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 00:44:41,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 00:44:41,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 00:44:41,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:44:41,598 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 00:44:41,598 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:44:41,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 00:44:41,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:44:41,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:44:41,599 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 00:44:41,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:44:41,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:44:41,600 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:44:41,600 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 00:44:41,602 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 00:44:41,602 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-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/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-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0d0ad10124da460587cca853afd7fd9944c9aa2 [2020-11-30 00:44:41,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:44:41,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:44:41,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:44:41,941 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:44:41,942 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:44:41,943 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/../../sv-benchmarks/c/termination-restricted-15/NO_13.c [2020-11-30 00:44:42,023 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/data/dede1473e/d625d03a30124abf98b75ea165f62969/FLAGc2548921f [2020-11-30 00:44:42,515 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:44:42,516 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/sv-benchmarks/c/termination-restricted-15/NO_13.c [2020-11-30 00:44:42,524 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/data/dede1473e/d625d03a30124abf98b75ea165f62969/FLAGc2548921f [2020-11-30 00:44:42,906 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/data/dede1473e/d625d03a30124abf98b75ea165f62969 [2020-11-30 00:44:42,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:44:42,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:44:42,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:44:42,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:44:42,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:44:42,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:44:42" (1/1) ... [2020-11-30 00:44:42,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1561c2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:44:42, skipping insertion in model container [2020-11-30 00:44:42,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:44:42" (1/1) ... [2020-11-30 00:44:42,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:44:42,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:44:43,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:44:43,146 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:44:43,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:44:43,174 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:44:43,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:44:43 WrapperNode [2020-11-30 00:44:43,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:44:43,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:44:43,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:44:43,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:44:43,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:44:43" (1/1) ... [2020-11-30 00:44:43,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:44:43" (1/1) ... [2020-11-30 00:44:43,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:44:43,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:44:43,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:44:43,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:44:43,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:44:43" (1/1) ... [2020-11-30 00:44:43,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:44:43" (1/1) ... [2020-11-30 00:44:43,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:44:43" (1/1) ... [2020-11-30 00:44:43,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:44:43" (1/1) ... [2020-11-30 00:44:43,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:44:43" (1/1) ... [2020-11-30 00:44:43,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:44:43" (1/1) ... [2020-11-30 00:44:43,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:44:43" (1/1) ... [2020-11-30 00:44:43,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:44:43,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:44:43,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:44:43,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:44:43,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:44:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:43,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:44:43,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:44:43,525 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:44:43,525 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-11-30 00:44:43,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:44:43 BoogieIcfgContainer [2020-11-30 00:44:43,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:44:43,529 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 00:44:43,529 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 00:44:43,533 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 00:44:43,534 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:44:43,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 12:44:42" (1/3) ... [2020-11-30 00:44:43,537 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f8d2412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:44:43, skipping insertion in model container [2020-11-30 00:44:43,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:44:43,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:44:43" (2/3) ... [2020-11-30 00:44:43,538 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f8d2412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:44:43, skipping insertion in model container [2020-11-30 00:44:43,538 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:44:43,538 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:44:43" (3/3) ... [2020-11-30 00:44:43,540 INFO L373 chiAutomizerObserver]: Analyzing ICFG NO_13.c [2020-11-30 00:44:43,621 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 00:44:43,621 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 00:44:43,621 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 00:44:43,621 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:44:43,622 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:44:43,622 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 00:44:43,622 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:44:43,622 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 00:44:43,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-11-30 00:44:43,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-30 00:44:43,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:43,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:43,667 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-11-30 00:44:43,667 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:44:43,668 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 00:44:43,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-11-30 00:44:43,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-30 00:44:43,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:43,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:43,670 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-11-30 00:44:43,670 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:44:43,678 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 3#L12-2true [2020-11-30 00:44:43,678 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~i~0 < main_~j~0); 6#L12true assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3#L12-2true [2020-11-30 00:44:43,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:43,684 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-11-30 00:44:43,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:43,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224219101] [2020-11-30 00:44:43,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:43,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:43,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:43,789 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:43,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:43,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2020-11-30 00:44:43,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:43,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632571489] [2020-11-30 00:44:43,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:43,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:43,836 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:43,840 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:43,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:43,843 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2020-11-30 00:44:43,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:43,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185917161] [2020-11-30 00:44:43,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:43,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:43,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:43,883 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:44,045 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-30 00:44:44,100 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:44:44,101 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:44:44,101 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:44:44,101 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:44:44,101 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-30 00:44:44,102 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:44,102 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:44:44,102 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:44:44,102 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2020-11-30 00:44:44,103 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:44:44,103 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:44:44,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:44,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:44,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:44,317 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:44:44,317 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:44,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:44:44,331 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:44,344 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:44:44,344 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:44,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:44:44,389 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:44,396 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:44:44,396 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:44,444 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:44:44,444 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:44,505 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-30 00:44:44,505 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:44,561 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-30 00:44:44,564 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:44:44,564 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:44:44,565 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:44:44,565 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:44:44,565 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:44:44,565 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:44,565 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:44:44,566 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:44:44,566 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2020-11-30 00:44:44,566 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:44:44,566 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:44:44,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:44,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:44,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:44,736 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:44:44,742 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:44,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:44:44,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:44,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:44,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:44,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:44,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:44:44,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:44,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:44,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:44:44,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:44,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:44,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:44,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:44,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:44:44,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:44,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:44,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:44:44,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:44,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:44:44,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:44,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:44,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:44,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:44:44,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:44,911 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:44:44,916 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-11-30 00:44:44,916 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:44,926 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:44:44,927 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-30 00:44:44,927 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:44:44,928 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:44,975 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-30 00:44:45,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:45,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:44:45,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:45,085 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:44:45,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:45,112 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-11-30 00:44:45,114 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2020-11-30 00:44:45,176 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2020-11-30 00:44:45,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 00:44:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:44:45,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-11-30 00:44:45,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2020-11-30 00:44:45,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:45,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2020-11-30 00:44:45,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:45,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2020-11-30 00:44:45,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:45,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2020-11-30 00:44:45,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-30 00:44:45,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2020-11-30 00:44:45,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-11-30 00:44:45,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-11-30 00:44:45,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-11-30 00:44:45,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:45,220 INFO L691 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-11-30 00:44:45,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-11-30 00:44:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-11-30 00:44:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-30 00:44:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-11-30 00:44:45,253 INFO L714 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-11-30 00:44:45,254 INFO L594 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-11-30 00:44:45,254 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 00:44:45,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-11-30 00:44:45,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-30 00:44:45,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:45,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:45,256 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-11-30 00:44:45,256 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:44:45,256 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 69#L12-2 assume !!(main_~i~0 < main_~j~0); 67#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 63#L12-2 [2020-11-30 00:44:45,256 INFO L796 eck$LassoCheckResult]: Loop: 63#L12-2 assume !!(main_~i~0 < main_~j~0); 64#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 63#L12-2 [2020-11-30 00:44:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:45,257 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2020-11-30 00:44:45,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:45,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881163405] [2020-11-30 00:44:45,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:45,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881163405] [2020-11-30 00:44:45,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:44:45,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:44:45,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770777408] [2020-11-30 00:44:45,307 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:44:45,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:45,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2020-11-30 00:44:45,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:45,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254084217] [2020-11-30 00:44:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:45,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:45,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:45,321 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:45,355 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:44:45,355 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:44:45,355 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:44:45,355 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:44:45,355 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-30 00:44:45,355 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:45,356 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:44:45,356 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:44:45,356 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2020-11-30 00:44:45,356 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:44:45,356 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:44:45,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:45,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:45,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:45,488 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:44:45,488 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:45,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:44:45,492 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:45,498 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:44:45,498 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:45,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:44:45,536 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:44:45,541 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:44:45,541 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:45,570 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:44:45,570 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:45,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-30 00:44:45,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:44:45,664 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-30 00:44:45,666 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:44:45,666 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:44:45,666 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:44:45,666 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:44:45,667 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:44:45,667 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:45,667 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:44:45,667 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:44:45,667 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2020-11-30 00:44:45,667 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:44:45,667 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:44:45,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:45,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:45,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:45,768 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:44:45,768 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:45,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:44:45,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:45,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:45,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:45,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:45,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:44:45,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:44:45,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:45,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:44:45,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:45,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:44:45,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:45,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:45,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:45,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:44:45,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:44:45,863 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:44:45,867 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-30 00:44:45,867 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:45,906 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:44:45,906 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-30 00:44:45,907 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:44:45,907 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-11-30 00:44:45,932 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-30 00:44:45,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:45,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:44:45,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:45,992 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:44:45,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:45,993 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-11-30 00:44:45,994 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-11-30 00:44:46,013 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2020-11-30 00:44:46,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 00:44:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:44:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-11-30 00:44:46,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2020-11-30 00:44:46,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:46,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2020-11-30 00:44:46,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:46,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2020-11-30 00:44:46,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:46,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2020-11-30 00:44:46,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-30 00:44:46,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2020-11-30 00:44:46,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-11-30 00:44:46,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-30 00:44:46,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2020-11-30 00:44:46,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:46,020 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-11-30 00:44:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2020-11-30 00:44:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-11-30 00:44:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-11-30 00:44:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-11-30 00:44:46,022 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-11-30 00:44:46,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:46,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:44:46,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:44:46,030 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 3 states. [2020-11-30 00:44:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:46,048 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-11-30 00:44:46,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:44:46,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2020-11-30 00:44:46,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-30 00:44:46,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2020-11-30 00:44:46,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-11-30 00:44:46,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-30 00:44:46,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2020-11-30 00:44:46,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:46,051 INFO L691 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-11-30 00:44:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2020-11-30 00:44:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-11-30 00:44:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-11-30 00:44:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2020-11-30 00:44:46,054 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-11-30 00:44:46,054 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-11-30 00:44:46,054 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 00:44:46,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2020-11-30 00:44:46,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-11-30 00:44:46,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:46,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:46,063 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1] [2020-11-30 00:44:46,063 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:44:46,064 INFO L794 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 139#L12-2 assume !!(main_~i~0 < main_~j~0); 140#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 149#L12-2 assume !!(main_~i~0 < main_~j~0); 148#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 146#L12-2 assume !!(main_~i~0 < main_~j~0); 142#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 145#L12-2 [2020-11-30 00:44:46,064 INFO L796 eck$LassoCheckResult]: Loop: 145#L12-2 assume !!(main_~i~0 < main_~j~0); 147#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 145#L12-2 [2020-11-30 00:44:46,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:46,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1366043347, now seen corresponding path program 1 times [2020-11-30 00:44:46,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:46,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159317821] [2020-11-30 00:44:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:46,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159317821] [2020-11-30 00:44:46,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202986367] [2020-11-30 00:44:46,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:46,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 00:44:46,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:46,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:46,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-11-30 00:44:46,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111549346] [2020-11-30 00:44:46,191 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:44:46,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:46,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2020-11-30 00:44:46,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:46,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847416396] [2020-11-30 00:44:46,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:46,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:46,202 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:46,205 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:46,245 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:44:46,245 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:44:46,245 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:44:46,246 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:44:46,246 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-30 00:44:46,246 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:46,246 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:44:46,246 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:44:46,246 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2020-11-30 00:44:46,246 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:44:46,247 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:44:46,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:46,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:46,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:46,371 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:44:46,372 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:46,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:44:46,379 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:46,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-30 00:44:46,446 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:46,499 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-30 00:44:46,502 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:44:46,502 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:44:46,502 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:44:46,502 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:44:46,502 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:44:46,502 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:46,502 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:44:46,503 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:44:46,503 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2020-11-30 00:44:46,503 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:44:46,503 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:44:46,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:46,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:46,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:46,656 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:44:46,656 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:46,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:44:46,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:46,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:44:46,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:46,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:46,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:46,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:44:46,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:46,689 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:44:46,735 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-30 00:44:46,736 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:46,746 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:44:46,746 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-30 00:44:46,746 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:44:46,746 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:46,786 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-30 00:44:46,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:46,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:44:46,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:46,915 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:44:46,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:46,916 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-11-30 00:44:46,917 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-11-30 00:44:46,931 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 13 states and 19 transitions. Complement of second has 5 states. [2020-11-30 00:44:46,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 00:44:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:44:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-11-30 00:44:46,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2020-11-30 00:44:46,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:46,933 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:44:46,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:46,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:44:46,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:46,990 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:44:46,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:46,993 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2020-11-30 00:44:46,993 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-11-30 00:44:47,017 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 13 states and 19 transitions. Complement of second has 5 states. [2020-11-30 00:44:47,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 00:44:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:44:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-11-30 00:44:47,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2020-11-30 00:44:47,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:47,020 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:44:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:47,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:44:47,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:47,074 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:44:47,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:47,076 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-11-30 00:44:47,076 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-11-30 00:44:47,097 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 15 states and 22 transitions. Complement of second has 4 states. [2020-11-30 00:44:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 00:44:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:44:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-11-30 00:44:47,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2020-11-30 00:44:47,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:47,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2020-11-30 00:44:47,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:47,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2020-11-30 00:44:47,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:47,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2020-11-30 00:44:47,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-30 00:44:47,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 18 transitions. [2020-11-30 00:44:47,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-11-30 00:44:47,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-11-30 00:44:47,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-11-30 00:44:47,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:47,104 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-30 00:44:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-11-30 00:44:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 6. [2020-11-30 00:44:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-11-30 00:44:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2020-11-30 00:44:47,106 INFO L714 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-11-30 00:44:47,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:47,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:44:47,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:44:47,110 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand 4 states. [2020-11-30 00:44:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:47,137 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2020-11-30 00:44:47,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:44:47,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2020-11-30 00:44:47,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-30 00:44:47,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 11 transitions. [2020-11-30 00:44:47,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-11-30 00:44:47,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-11-30 00:44:47,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-11-30 00:44:47,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:47,140 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-11-30 00:44:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-11-30 00:44:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-11-30 00:44:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-30 00:44:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-11-30 00:44:47,142 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-11-30 00:44:47,142 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-11-30 00:44:47,142 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 00:44:47,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-11-30 00:44:47,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-11-30 00:44:47,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:47,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:47,143 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1] [2020-11-30 00:44:47,143 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:44:47,143 INFO L794 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 335#L12-2 assume !!(main_~i~0 < main_~j~0); 336#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 337#L12-2 assume !!(main_~i~0 < main_~j~0); 338#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 342#L12-2 assume !!(main_~i~0 < main_~j~0); 340#L12 [2020-11-30 00:44:47,144 INFO L796 eck$LassoCheckResult]: Loop: 340#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 341#L12-2 assume !!(main_~i~0 < main_~j~0); 340#L12 [2020-11-30 00:44:47,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash 925765348, now seen corresponding path program 2 times [2020-11-30 00:44:47,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:47,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755198865] [2020-11-30 00:44:47,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:47,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:47,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:47,162 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:47,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:47,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 1 times [2020-11-30 00:44:47,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:47,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373932199] [2020-11-30 00:44:47,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:47,175 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:47,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:47,185 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:47,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:47,187 INFO L82 PathProgramCache]: Analyzing trace with hash 602269631, now seen corresponding path program 2 times [2020-11-30 00:44:47,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:47,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913224045] [2020-11-30 00:44:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:47,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:47,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913224045] [2020-11-30 00:44:47,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131346078] [2020-11-30 00:44:47,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:47,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:44:47,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:47,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:44:47,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:47,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:47,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-11-30 00:44:47,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569880641] [2020-11-30 00:44:47,336 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:44:47,336 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:44:47,336 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:44:47,336 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:44:47,336 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-30 00:44:47,336 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:47,336 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:44:47,336 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:44:47,337 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2020-11-30 00:44:47,337 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:44:47,337 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:44:47,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:47,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:47,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:47,449 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:44:47,449 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:47,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:44:47,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-11-30 00:44:47,485 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:44:47,485 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:47,529 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:44:47,529 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:47,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-30 00:44:47,582 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:47,628 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-30 00:44:47,629 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:44:47,629 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:44:47,630 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:44:47,630 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:44:47,630 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:44:47,630 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:47,630 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:44:47,630 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:44:47,630 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2020-11-30 00:44:47,630 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:44:47,630 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:44:47,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:47,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:47,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:44:47,764 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:44:47,764 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:47,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:44:47,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:44:47,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:44:47,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:44:47,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:44:47,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:44:47,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:44:47,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:44:47,783 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:44:47,788 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-30 00:44:47,788 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:44:47,792 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:44:47,792 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-30 00:44:47,792 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:44:47,793 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 103 Supporting invariants [] Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:44:47,835 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-30 00:44:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:47,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:44:47,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:47,888 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:44:47,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:47,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:47,927 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 [2020-11-30 00:44:47,927 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-11-30 00:44:47,937 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 8 states and 10 transitions. Complement of second has 3 states. [2020-11-30 00:44:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2020-11-30 00:44:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:44:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2020-11-30 00:44:47,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 6 letters. Loop has 2 letters. [2020-11-30 00:44:47,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:47,939 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:44:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:47,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:44:47,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:47,979 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:44:47,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:48,023 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:44:48,023 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-11-30 00:44:48,032 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 8 states and 10 transitions. Complement of second has 3 states. [2020-11-30 00:44:48,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2020-11-30 00:44:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:44:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2020-11-30 00:44:48,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 6 letters. Loop has 2 letters. [2020-11-30 00:44:48,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:48,034 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-11-30 00:44:48,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:48,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:44:48,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:48,083 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:44:48,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:44:48,117 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:44:48,117 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-11-30 00:44:48,133 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 12 states and 14 transitions. Complement of second has 4 states. [2020-11-30 00:44:48,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 00:44:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:44:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-11-30 00:44:48,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2020-11-30 00:44:48,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:48,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2020-11-30 00:44:48,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:48,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2020-11-30 00:44:48,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:44:48,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2020-11-30 00:44:48,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-30 00:44:48,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 12 transitions. [2020-11-30 00:44:48,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:48,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:48,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2020-11-30 00:44:48,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:48,142 INFO L691 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-11-30 00:44:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2020-11-30 00:44:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2020-11-30 00:44:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-11-30 00:44:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2020-11-30 00:44:48,147 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-11-30 00:44:48,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:48,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:44:48,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:44:48,149 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2020-11-30 00:44:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:48,175 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-11-30 00:44:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:44:48,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2020-11-30 00:44:48,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:48,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 14 transitions. [2020-11-30 00:44:48,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:48,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:48,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2020-11-30 00:44:48,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:48,177 INFO L691 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-11-30 00:44:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2020-11-30 00:44:48,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-11-30 00:44:48,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-11-30 00:44:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2020-11-30 00:44:48,179 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-11-30 00:44:48,179 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-11-30 00:44:48,179 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 00:44:48,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-11-30 00:44:48,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:48,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:48,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:48,180 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 1] [2020-11-30 00:44:48,180 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:48,180 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 515#L12-2 assume !!(main_~i~0 < main_~j~0); 516#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 517#L12-2 assume !!(main_~i~0 < main_~j~0); 518#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 525#L12-2 assume !!(main_~i~0 < main_~j~0); 524#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 523#L12-2 assume !!(main_~i~0 < main_~j~0); 520#L12 [2020-11-30 00:44:48,180 INFO L796 eck$LassoCheckResult]: Loop: 520#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 521#L12-2 assume !!(main_~i~0 < main_~j~0); 524#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 523#L12-2 assume !!(main_~i~0 < main_~j~0); 520#L12 [2020-11-30 00:44:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash 602269569, now seen corresponding path program 3 times [2020-11-30 00:44:48,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:48,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133831072] [2020-11-30 00:44:48,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:48,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:48,214 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:48,216 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:48,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:48,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2020-11-30 00:44:48,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:48,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863244619] [2020-11-30 00:44:48,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:48,227 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:48,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:48,249 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:48,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:48,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1740322745, now seen corresponding path program 3 times [2020-11-30 00:44:48,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:48,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944877617] [2020-11-30 00:44:48,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:48,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944877617] [2020-11-30 00:44:48,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668880521] [2020-11-30 00:44:48,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-11-30 00:44:48,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-11-30 00:44:48,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:48,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:44:48,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:48,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:48,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-11-30 00:44:48,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467367342] [2020-11-30 00:44:48,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:48,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:44:48,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:44:48,408 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 3 Second operand 6 states. [2020-11-30 00:44:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:48,441 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-11-30 00:44:48,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:44:48,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-11-30 00:44:48,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:48,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2020-11-30 00:44:48,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:48,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:48,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2020-11-30 00:44:48,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:48,444 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-11-30 00:44:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2020-11-30 00:44:48,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-11-30 00:44:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-30 00:44:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2020-11-30 00:44:48,446 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-11-30 00:44:48,446 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-11-30 00:44:48,446 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 00:44:48,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2020-11-30 00:44:48,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:48,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:48,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:48,447 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 1] [2020-11-30 00:44:48,447 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:48,448 INFO L794 eck$LassoCheckResult]: Stem: 589#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 585#L12-2 assume !!(main_~i~0 < main_~j~0); 586#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 587#L12-2 assume !!(main_~i~0 < main_~j~0); 588#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 597#L12-2 assume !!(main_~i~0 < main_~j~0); 596#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 595#L12-2 assume !!(main_~i~0 < main_~j~0); 594#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 593#L12-2 assume !!(main_~i~0 < main_~j~0); 590#L12 [2020-11-30 00:44:48,448 INFO L796 eck$LassoCheckResult]: Loop: 590#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 591#L12-2 assume !!(main_~i~0 < main_~j~0); 594#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 593#L12-2 assume !!(main_~i~0 < main_~j~0); 590#L12 [2020-11-30 00:44:48,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:48,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1039528738, now seen corresponding path program 4 times [2020-11-30 00:44:48,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:48,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033847847] [2020-11-30 00:44:48,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:48,456 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:48,470 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:48,472 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:48,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:48,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 2 times [2020-11-30 00:44:48,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:48,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145684092] [2020-11-30 00:44:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:48,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:48,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:48,484 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:48,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:48,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1650681494, now seen corresponding path program 4 times [2020-11-30 00:44:48,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:48,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867503296] [2020-11-30 00:44:48,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:48,555 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:48,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867503296] [2020-11-30 00:44:48,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697244958] [2020-11-30 00:44:48,556 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:48,586 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 00:44:48,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:48,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 00:44:48,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:48,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:48,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-11-30 00:44:48,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717600348] [2020-11-30 00:44:48,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:48,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:44:48,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:44:48,686 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 7 states. [2020-11-30 00:44:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:48,796 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-11-30 00:44:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:44:48,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2020-11-30 00:44:48,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:48,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 18 transitions. [2020-11-30 00:44:48,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:48,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:48,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2020-11-30 00:44:48,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:48,799 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-11-30 00:44:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2020-11-30 00:44:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-11-30 00:44:48,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-30 00:44:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-11-30 00:44:48,801 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-11-30 00:44:48,801 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-11-30 00:44:48,801 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-30 00:44:48,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-11-30 00:44:48,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:48,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:48,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:48,803 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 1] [2020-11-30 00:44:48,803 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:48,803 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 666#L12-2 assume !!(main_~i~0 < main_~j~0); 667#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 668#L12-2 assume !!(main_~i~0 < main_~j~0); 669#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 680#L12-2 assume !!(main_~i~0 < main_~j~0); 679#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 678#L12-2 assume !!(main_~i~0 < main_~j~0); 676#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 675#L12-2 assume !!(main_~i~0 < main_~j~0); 674#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 673#L12-2 assume !!(main_~i~0 < main_~j~0); 671#L12 [2020-11-30 00:44:48,803 INFO L796 eck$LassoCheckResult]: Loop: 671#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 672#L12-2 assume !!(main_~i~0 < main_~j~0); 674#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 673#L12-2 assume !!(main_~i~0 < main_~j~0); 671#L12 [2020-11-30 00:44:48,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:48,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1740263163, now seen corresponding path program 5 times [2020-11-30 00:44:48,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:48,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075619742] [2020-11-30 00:44:48,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:48,813 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:48,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:48,832 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:48,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 3 times [2020-11-30 00:44:48,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:48,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233805424] [2020-11-30 00:44:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:48,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:48,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:48,843 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:48,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:48,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1404785203, now seen corresponding path program 5 times [2020-11-30 00:44:48,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:48,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067478275] [2020-11-30 00:44:48,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:48,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067478275] [2020-11-30 00:44:48,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082807483] [2020-11-30 00:44:48,943 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:48,974 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2020-11-30 00:44:48,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:48,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 00:44:48,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:49,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:49,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-11-30 00:44:49,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233361754] [2020-11-30 00:44:49,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:49,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:44:49,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:44:49,093 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 3 Second operand 8 states. [2020-11-30 00:44:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:49,134 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-11-30 00:44:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:44:49,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2020-11-30 00:44:49,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:49,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 20 transitions. [2020-11-30 00:44:49,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:49,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:49,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2020-11-30 00:44:49,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:49,137 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-11-30 00:44:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2020-11-30 00:44:49,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-11-30 00:44:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-30 00:44:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-11-30 00:44:49,142 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-11-30 00:44:49,142 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-11-30 00:44:49,143 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-30 00:44:49,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2020-11-30 00:44:49,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:49,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:49,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:49,149 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 1] [2020-11-30 00:44:49,150 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:49,151 INFO L794 eck$LassoCheckResult]: Stem: 762#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 758#L12-2 assume !!(main_~i~0 < main_~j~0); 759#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 760#L12-2 assume !!(main_~i~0 < main_~j~0); 761#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 765#L12-2 assume !!(main_~i~0 < main_~j~0); 774#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 773#L12-2 assume !!(main_~i~0 < main_~j~0); 772#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 771#L12-2 assume !!(main_~i~0 < main_~j~0); 769#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 768#L12-2 assume !!(main_~i~0 < main_~j~0); 767#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 766#L12-2 assume !!(main_~i~0 < main_~j~0); 763#L12 [2020-11-30 00:44:49,151 INFO L796 eck$LassoCheckResult]: Loop: 763#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 764#L12-2 assume !!(main_~i~0 < main_~j~0); 767#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 766#L12-2 assume !!(main_~i~0 < main_~j~0); 763#L12 [2020-11-30 00:44:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:49,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1650621912, now seen corresponding path program 6 times [2020-11-30 00:44:49,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:49,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440565446] [2020-11-30 00:44:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:49,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:49,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:49,184 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:49,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:49,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 4 times [2020-11-30 00:44:49,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:49,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166295918] [2020-11-30 00:44:49,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:49,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:49,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:49,204 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:49,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:49,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1321650832, now seen corresponding path program 6 times [2020-11-30 00:44:49,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:49,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195704693] [2020-11-30 00:44:49,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:49,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195704693] [2020-11-30 00:44:49,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758209227] [2020-11-30 00:44:49,321 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:49,360 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2020-11-30 00:44:49,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:49,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:44:49,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:49,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:49,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-11-30 00:44:49,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690601781] [2020-11-30 00:44:49,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:49,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:44:49,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:44:49,454 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 3 Second operand 9 states. [2020-11-30 00:44:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:49,503 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-11-30 00:44:49,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:44:49,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-11-30 00:44:49,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:49,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 22 transitions. [2020-11-30 00:44:49,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:49,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:49,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-11-30 00:44:49,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:49,506 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-11-30 00:44:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-11-30 00:44:49,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-11-30 00:44:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-30 00:44:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-11-30 00:44:49,508 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-11-30 00:44:49,508 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-11-30 00:44:49,508 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-30 00:44:49,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2020-11-30 00:44:49,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:49,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:49,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:49,510 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 1] [2020-11-30 00:44:49,510 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:49,510 INFO L794 eck$LassoCheckResult]: Stem: 865#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 861#L12-2 assume !!(main_~i~0 < main_~j~0); 862#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 863#L12-2 assume !!(main_~i~0 < main_~j~0); 864#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 868#L12-2 assume !!(main_~i~0 < main_~j~0); 879#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 878#L12-2 assume !!(main_~i~0 < main_~j~0); 877#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 876#L12-2 assume !!(main_~i~0 < main_~j~0); 875#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 874#L12-2 assume !!(main_~i~0 < main_~j~0); 872#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 871#L12-2 assume !!(main_~i~0 < main_~j~0); 870#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 869#L12-2 assume !!(main_~i~0 < main_~j~0); 866#L12 [2020-11-30 00:44:49,510 INFO L796 eck$LassoCheckResult]: Loop: 866#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 867#L12-2 assume !!(main_~i~0 < main_~j~0); 870#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 869#L12-2 assume !!(main_~i~0 < main_~j~0); 866#L12 [2020-11-30 00:44:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:49,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1404725621, now seen corresponding path program 7 times [2020-11-30 00:44:49,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:49,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270665033] [2020-11-30 00:44:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:49,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:49,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:49,536 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:49,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:49,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 5 times [2020-11-30 00:44:49,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:49,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661062365] [2020-11-30 00:44:49,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:49,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:49,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:49,554 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:49,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1261068371, now seen corresponding path program 7 times [2020-11-30 00:44:49,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:49,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126571146] [2020-11-30 00:44:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:49,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126571146] [2020-11-30 00:44:49,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574979058] [2020-11-30 00:44:49,676 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:49,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 00:44:49,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:49,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:49,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-11-30 00:44:49,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123197154] [2020-11-30 00:44:49,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:49,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:44:49,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:44:49,826 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 3 Second operand 10 states. [2020-11-30 00:44:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:49,874 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-11-30 00:44:49,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:44:49,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2020-11-30 00:44:49,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:49,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 24 transitions. [2020-11-30 00:44:49,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:49,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:49,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2020-11-30 00:44:49,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:49,876 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-11-30 00:44:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2020-11-30 00:44:49,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-11-30 00:44:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-30 00:44:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-11-30 00:44:49,879 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-11-30 00:44:49,879 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-11-30 00:44:49,879 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-30 00:44:49,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2020-11-30 00:44:49,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:49,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:49,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:49,881 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 1] [2020-11-30 00:44:49,881 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:49,881 INFO L794 eck$LassoCheckResult]: Stem: 979#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 975#L12-2 assume !!(main_~i~0 < main_~j~0); 976#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 977#L12-2 assume !!(main_~i~0 < main_~j~0); 978#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 982#L12-2 assume !!(main_~i~0 < main_~j~0); 995#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 994#L12-2 assume !!(main_~i~0 < main_~j~0); 993#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 992#L12-2 assume !!(main_~i~0 < main_~j~0); 991#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 990#L12-2 assume !!(main_~i~0 < main_~j~0); 989#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 988#L12-2 assume !!(main_~i~0 < main_~j~0); 986#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 985#L12-2 assume !!(main_~i~0 < main_~j~0); 984#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 983#L12-2 assume !!(main_~i~0 < main_~j~0); 980#L12 [2020-11-30 00:44:49,881 INFO L796 eck$LassoCheckResult]: Loop: 980#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 981#L12-2 assume !!(main_~i~0 < main_~j~0); 984#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 983#L12-2 assume !!(main_~i~0 < main_~j~0); 980#L12 [2020-11-30 00:44:49,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:49,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1321591250, now seen corresponding path program 8 times [2020-11-30 00:44:49,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:49,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414161338] [2020-11-30 00:44:49,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:49,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:49,896 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:49,898 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:49,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:49,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 6 times [2020-11-30 00:44:49,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:49,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790767983] [2020-11-30 00:44:49,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:49,902 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:49,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:49,906 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:49,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:49,906 INFO L82 PathProgramCache]: Analyzing trace with hash -763125366, now seen corresponding path program 8 times [2020-11-30 00:44:49,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:49,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007867259] [2020-11-30 00:44:49,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:50,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007867259] [2020-11-30 00:44:50,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120654398] [2020-11-30 00:44:50,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:50,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:44:50,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:50,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 00:44:50,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:50,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:50,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-11-30 00:44:50,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854369823] [2020-11-30 00:44:50,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:50,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:44:50,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:44:50,148 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 3 Second operand 11 states. [2020-11-30 00:44:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:50,215 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-11-30 00:44:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 00:44:50,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2020-11-30 00:44:50,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:50,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 26 transitions. [2020-11-30 00:44:50,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:50,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:50,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2020-11-30 00:44:50,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:50,218 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-11-30 00:44:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2020-11-30 00:44:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-11-30 00:44:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-30 00:44:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-11-30 00:44:50,221 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-11-30 00:44:50,221 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-11-30 00:44:50,221 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-30 00:44:50,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2020-11-30 00:44:50,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:50,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:50,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:50,222 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 1] [2020-11-30 00:44:50,223 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:50,223 INFO L794 eck$LassoCheckResult]: Stem: 1104#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1100#L12-2 assume !!(main_~i~0 < main_~j~0); 1101#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1102#L12-2 assume !!(main_~i~0 < main_~j~0); 1103#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1107#L12-2 assume !!(main_~i~0 < main_~j~0); 1122#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1121#L12-2 assume !!(main_~i~0 < main_~j~0); 1120#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1119#L12-2 assume !!(main_~i~0 < main_~j~0); 1118#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1117#L12-2 assume !!(main_~i~0 < main_~j~0); 1116#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1115#L12-2 assume !!(main_~i~0 < main_~j~0); 1114#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1113#L12-2 assume !!(main_~i~0 < main_~j~0); 1111#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1110#L12-2 assume !!(main_~i~0 < main_~j~0); 1109#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1108#L12-2 assume !!(main_~i~0 < main_~j~0); 1105#L12 [2020-11-30 00:44:50,223 INFO L796 eck$LassoCheckResult]: Loop: 1105#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 1106#L12-2 assume !!(main_~i~0 < main_~j~0); 1109#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1108#L12-2 assume !!(main_~i~0 < main_~j~0); 1105#L12 [2020-11-30 00:44:50,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:50,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1261127953, now seen corresponding path program 9 times [2020-11-30 00:44:50,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:50,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52670929] [2020-11-30 00:44:50,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:50,232 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:50,238 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:50,240 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:50,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:50,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 7 times [2020-11-30 00:44:50,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:50,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79093033] [2020-11-30 00:44:50,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:50,245 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:50,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:50,248 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:50,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1018732583, now seen corresponding path program 9 times [2020-11-30 00:44:50,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:50,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304632978] [2020-11-30 00:44:50,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:50,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304632978] [2020-11-30 00:44:50,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857614230] [2020-11-30 00:44:50,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:50,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2020-11-30 00:44:50,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:50,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 00:44:50,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:50,461 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:50,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:50,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-11-30 00:44:50,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000785368] [2020-11-30 00:44:50,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:50,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 00:44:50,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:44:50,514 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 3 Second operand 12 states. [2020-11-30 00:44:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:50,571 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-11-30 00:44:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 00:44:50,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2020-11-30 00:44:50,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:50,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 28 transitions. [2020-11-30 00:44:50,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:50,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:50,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2020-11-30 00:44:50,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:50,574 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-11-30 00:44:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2020-11-30 00:44:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-11-30 00:44:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-30 00:44:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-11-30 00:44:50,577 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-11-30 00:44:50,577 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-11-30 00:44:50,577 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-30 00:44:50,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2020-11-30 00:44:50,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:50,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:50,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:50,578 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 1] [2020-11-30 00:44:50,579 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:50,579 INFO L794 eck$LassoCheckResult]: Stem: 1240#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1236#L12-2 assume !!(main_~i~0 < main_~j~0); 1237#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1238#L12-2 assume !!(main_~i~0 < main_~j~0); 1239#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1243#L12-2 assume !!(main_~i~0 < main_~j~0); 1260#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1259#L12-2 assume !!(main_~i~0 < main_~j~0); 1258#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1257#L12-2 assume !!(main_~i~0 < main_~j~0); 1256#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1255#L12-2 assume !!(main_~i~0 < main_~j~0); 1254#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1253#L12-2 assume !!(main_~i~0 < main_~j~0); 1252#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1251#L12-2 assume !!(main_~i~0 < main_~j~0); 1250#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1249#L12-2 assume !!(main_~i~0 < main_~j~0); 1247#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1246#L12-2 assume !!(main_~i~0 < main_~j~0); 1245#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1244#L12-2 assume !!(main_~i~0 < main_~j~0); 1241#L12 [2020-11-30 00:44:50,579 INFO L796 eck$LassoCheckResult]: Loop: 1241#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 1242#L12-2 assume !!(main_~i~0 < main_~j~0); 1245#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1244#L12-2 assume !!(main_~i~0 < main_~j~0); 1241#L12 [2020-11-30 00:44:50,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:50,579 INFO L82 PathProgramCache]: Analyzing trace with hash -763184948, now seen corresponding path program 10 times [2020-11-30 00:44:50,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:50,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658840891] [2020-11-30 00:44:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:50,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:50,600 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:50,606 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:50,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:50,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 8 times [2020-11-30 00:44:50,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:50,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193944211] [2020-11-30 00:44:50,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:50,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:50,615 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:50,616 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:50,617 INFO L82 PathProgramCache]: Analyzing trace with hash -307729532, now seen corresponding path program 10 times [2020-11-30 00:44:50,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:50,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688070121] [2020-11-30 00:44:50,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:50,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688070121] [2020-11-30 00:44:50,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233448729] [2020-11-30 00:44:50,816 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:50,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 00:44:50,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:50,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 00:44:50,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:50,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:50,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2020-11-30 00:44:50,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76720806] [2020-11-30 00:44:50,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:50,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 00:44:50,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-11-30 00:44:50,958 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. cyclomatic complexity: 3 Second operand 13 states. [2020-11-30 00:44:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:51,034 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-11-30 00:44:51,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 00:44:51,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2020-11-30 00:44:51,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:51,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 30 transitions. [2020-11-30 00:44:51,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:51,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:51,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 30 transitions. [2020-11-30 00:44:51,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:51,037 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-11-30 00:44:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 30 transitions. [2020-11-30 00:44:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-11-30 00:44:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-30 00:44:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-11-30 00:44:51,040 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-11-30 00:44:51,040 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-11-30 00:44:51,041 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-11-30 00:44:51,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2020-11-30 00:44:51,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:51,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:51,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:51,043 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 1] [2020-11-30 00:44:51,043 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:51,044 INFO L794 eck$LassoCheckResult]: Stem: 1387#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1383#L12-2 assume !!(main_~i~0 < main_~j~0); 1384#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1385#L12-2 assume !!(main_~i~0 < main_~j~0); 1386#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1390#L12-2 assume !!(main_~i~0 < main_~j~0); 1409#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1408#L12-2 assume !!(main_~i~0 < main_~j~0); 1407#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1406#L12-2 assume !!(main_~i~0 < main_~j~0); 1405#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1404#L12-2 assume !!(main_~i~0 < main_~j~0); 1403#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1402#L12-2 assume !!(main_~i~0 < main_~j~0); 1401#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1400#L12-2 assume !!(main_~i~0 < main_~j~0); 1399#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1398#L12-2 assume !!(main_~i~0 < main_~j~0); 1397#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1396#L12-2 assume !!(main_~i~0 < main_~j~0); 1394#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1393#L12-2 assume !!(main_~i~0 < main_~j~0); 1392#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1391#L12-2 assume !!(main_~i~0 < main_~j~0); 1388#L12 [2020-11-30 00:44:51,045 INFO L796 eck$LassoCheckResult]: Loop: 1388#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 1389#L12-2 assume !!(main_~i~0 < main_~j~0); 1392#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1391#L12-2 assume !!(main_~i~0 < main_~j~0); 1388#L12 [2020-11-30 00:44:51,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:51,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1018673001, now seen corresponding path program 11 times [2020-11-30 00:44:51,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:51,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499377295] [2020-11-30 00:44:51,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:51,065 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:51,075 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:51,078 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:51,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:51,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 9 times [2020-11-30 00:44:51,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:51,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941470033] [2020-11-30 00:44:51,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:51,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:51,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:51,095 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:51,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:51,096 INFO L82 PathProgramCache]: Analyzing trace with hash 567464865, now seen corresponding path program 11 times [2020-11-30 00:44:51,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:51,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427472087] [2020-11-30 00:44:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:51,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427472087] [2020-11-30 00:44:51,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425450715] [2020-11-30 00:44:51,335 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:51,376 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2020-11-30 00:44:51,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:51,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 00:44:51,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:51,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:51,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2020-11-30 00:44:51,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358400568] [2020-11-30 00:44:51,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:51,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 00:44:51,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:44:51,481 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 3 Second operand 14 states. [2020-11-30 00:44:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:51,558 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-11-30 00:44:51,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 00:44:51,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2020-11-30 00:44:51,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:51,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 32 transitions. [2020-11-30 00:44:51,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:51,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:51,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2020-11-30 00:44:51,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:51,560 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-11-30 00:44:51,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2020-11-30 00:44:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-11-30 00:44:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-11-30 00:44:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-11-30 00:44:51,563 INFO L714 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-11-30 00:44:51,563 INFO L594 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-11-30 00:44:51,563 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-11-30 00:44:51,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2020-11-30 00:44:51,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:51,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:51,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:51,565 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [13, 12, 1] [2020-11-30 00:44:51,565 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:51,565 INFO L794 eck$LassoCheckResult]: Stem: 1545#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1541#L12-2 assume !!(main_~i~0 < main_~j~0); 1542#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1543#L12-2 assume !!(main_~i~0 < main_~j~0); 1544#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1548#L12-2 assume !!(main_~i~0 < main_~j~0); 1569#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1568#L12-2 assume !!(main_~i~0 < main_~j~0); 1567#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1566#L12-2 assume !!(main_~i~0 < main_~j~0); 1565#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1564#L12-2 assume !!(main_~i~0 < main_~j~0); 1563#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1562#L12-2 assume !!(main_~i~0 < main_~j~0); 1561#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1560#L12-2 assume !!(main_~i~0 < main_~j~0); 1559#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1558#L12-2 assume !!(main_~i~0 < main_~j~0); 1557#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1556#L12-2 assume !!(main_~i~0 < main_~j~0); 1555#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1554#L12-2 assume !!(main_~i~0 < main_~j~0); 1552#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1551#L12-2 assume !!(main_~i~0 < main_~j~0); 1550#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1549#L12-2 assume !!(main_~i~0 < main_~j~0); 1546#L12 [2020-11-30 00:44:51,565 INFO L796 eck$LassoCheckResult]: Loop: 1546#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 1547#L12-2 assume !!(main_~i~0 < main_~j~0); 1550#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1549#L12-2 assume !!(main_~i~0 < main_~j~0); 1546#L12 [2020-11-30 00:44:51,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:51,566 INFO L82 PathProgramCache]: Analyzing trace with hash -307789114, now seen corresponding path program 12 times [2020-11-30 00:44:51,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:51,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487925596] [2020-11-30 00:44:51,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:51,573 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:51,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:51,582 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:51,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:51,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 10 times [2020-11-30 00:44:51,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:51,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316443797] [2020-11-30 00:44:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:51,585 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:51,587 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:51,588 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:51,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:51,589 INFO L82 PathProgramCache]: Analyzing trace with hash -184309634, now seen corresponding path program 12 times [2020-11-30 00:44:51,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:51,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041821307] [2020-11-30 00:44:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 39 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:51,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041821307] [2020-11-30 00:44:51,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305236392] [2020-11-30 00:44:51,800 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:51,849 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2020-11-30 00:44:51,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:51,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 00:44:51,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 39 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:51,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:51,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2020-11-30 00:44:51,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596548193] [2020-11-30 00:44:51,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:51,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-30 00:44:51,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2020-11-30 00:44:51,958 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 3 Second operand 15 states. [2020-11-30 00:44:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:52,071 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-11-30 00:44:52,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 00:44:52,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2020-11-30 00:44:52,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:52,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 34 transitions. [2020-11-30 00:44:52,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:52,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:52,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 34 transitions. [2020-11-30 00:44:52,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:52,074 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-11-30 00:44:52,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 34 transitions. [2020-11-30 00:44:52,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-11-30 00:44:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-30 00:44:52,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-11-30 00:44:52,077 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-11-30 00:44:52,077 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-11-30 00:44:52,077 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-11-30 00:44:52,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2020-11-30 00:44:52,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:52,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:52,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:52,078 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 1] [2020-11-30 00:44:52,079 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:52,079 INFO L794 eck$LassoCheckResult]: Stem: 1714#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1710#L12-2 assume !!(main_~i~0 < main_~j~0); 1711#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1712#L12-2 assume !!(main_~i~0 < main_~j~0); 1713#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1717#L12-2 assume !!(main_~i~0 < main_~j~0); 1740#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1739#L12-2 assume !!(main_~i~0 < main_~j~0); 1738#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1737#L12-2 assume !!(main_~i~0 < main_~j~0); 1736#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1735#L12-2 assume !!(main_~i~0 < main_~j~0); 1734#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1733#L12-2 assume !!(main_~i~0 < main_~j~0); 1732#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1731#L12-2 assume !!(main_~i~0 < main_~j~0); 1730#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1729#L12-2 assume !!(main_~i~0 < main_~j~0); 1728#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1727#L12-2 assume !!(main_~i~0 < main_~j~0); 1726#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1725#L12-2 assume !!(main_~i~0 < main_~j~0); 1724#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1723#L12-2 assume !!(main_~i~0 < main_~j~0); 1721#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1720#L12-2 assume !!(main_~i~0 < main_~j~0); 1719#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1718#L12-2 assume !!(main_~i~0 < main_~j~0); 1715#L12 [2020-11-30 00:44:52,079 INFO L796 eck$LassoCheckResult]: Loop: 1715#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 1716#L12-2 assume !!(main_~i~0 < main_~j~0); 1719#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1718#L12-2 assume !!(main_~i~0 < main_~j~0); 1715#L12 [2020-11-30 00:44:52,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:52,086 INFO L82 PathProgramCache]: Analyzing trace with hash 567405283, now seen corresponding path program 13 times [2020-11-30 00:44:52,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:52,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966007944] [2020-11-30 00:44:52,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:52,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:52,125 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:52,127 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:52,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:52,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 11 times [2020-11-30 00:44:52,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:52,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540254898] [2020-11-30 00:44:52,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:52,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:52,136 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:52,137 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:52,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1085097445, now seen corresponding path program 13 times [2020-11-30 00:44:52,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:52,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574784031] [2020-11-30 00:44:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:52,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574784031] [2020-11-30 00:44:52,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117801111] [2020-11-30 00:44:52,385 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:52,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 00:44:52,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:52,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:52,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2020-11-30 00:44:52,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705654349] [2020-11-30 00:44:52,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:52,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 00:44:52,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:44:52,511 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. cyclomatic complexity: 3 Second operand 16 states. [2020-11-30 00:44:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:52,599 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-11-30 00:44:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 00:44:52,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2020-11-30 00:44:52,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:52,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 34 states and 36 transitions. [2020-11-30 00:44:52,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:52,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:52,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 36 transitions. [2020-11-30 00:44:52,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:52,601 INFO L691 BuchiCegarLoop]: Abstraction has 34 states and 36 transitions. [2020-11-30 00:44:52,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 36 transitions. [2020-11-30 00:44:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-11-30 00:44:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-11-30 00:44:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-11-30 00:44:52,606 INFO L714 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-11-30 00:44:52,606 INFO L594 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-11-30 00:44:52,606 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-11-30 00:44:52,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2020-11-30 00:44:52,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:52,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:52,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:52,609 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [15, 14, 1] [2020-11-30 00:44:52,611 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:52,611 INFO L794 eck$LassoCheckResult]: Stem: 1894#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 1890#L12-2 assume !!(main_~i~0 < main_~j~0); 1891#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1892#L12-2 assume !!(main_~i~0 < main_~j~0); 1893#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1897#L12-2 assume !!(main_~i~0 < main_~j~0); 1922#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1921#L12-2 assume !!(main_~i~0 < main_~j~0); 1920#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1919#L12-2 assume !!(main_~i~0 < main_~j~0); 1918#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1917#L12-2 assume !!(main_~i~0 < main_~j~0); 1916#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1915#L12-2 assume !!(main_~i~0 < main_~j~0); 1914#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1913#L12-2 assume !!(main_~i~0 < main_~j~0); 1912#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1911#L12-2 assume !!(main_~i~0 < main_~j~0); 1910#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1909#L12-2 assume !!(main_~i~0 < main_~j~0); 1908#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1907#L12-2 assume !!(main_~i~0 < main_~j~0); 1906#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1905#L12-2 assume !!(main_~i~0 < main_~j~0); 1904#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1903#L12-2 assume !!(main_~i~0 < main_~j~0); 1901#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1900#L12-2 assume !!(main_~i~0 < main_~j~0); 1899#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1898#L12-2 assume !!(main_~i~0 < main_~j~0); 1895#L12 [2020-11-30 00:44:52,612 INFO L796 eck$LassoCheckResult]: Loop: 1895#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 1896#L12-2 assume !!(main_~i~0 < main_~j~0); 1899#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 1898#L12-2 assume !!(main_~i~0 < main_~j~0); 1895#L12 [2020-11-30 00:44:52,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:52,612 INFO L82 PathProgramCache]: Analyzing trace with hash -184369216, now seen corresponding path program 14 times [2020-11-30 00:44:52,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:52,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468257210] [2020-11-30 00:44:52,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:52,629 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:52,635 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:52,638 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:52,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:52,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 12 times [2020-11-30 00:44:52,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:52,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727434764] [2020-11-30 00:44:52,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:52,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:52,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:52,645 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:52,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:52,646 INFO L82 PathProgramCache]: Analyzing trace with hash 841209976, now seen corresponding path program 14 times [2020-11-30 00:44:52,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:52,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611837434] [2020-11-30 00:44:52,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:52,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611837434] [2020-11-30 00:44:52,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799613882] [2020-11-30 00:44:52,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:52,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:44:52,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:52,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 00:44:52,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:52,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:52,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2020-11-30 00:44:52,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772552743] [2020-11-30 00:44:53,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:53,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-30 00:44:53,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2020-11-30 00:44:53,039 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 3 Second operand 17 states. [2020-11-30 00:44:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:53,112 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-11-30 00:44:53,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-30 00:44:53,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 39 transitions. [2020-11-30 00:44:53,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:53,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 38 transitions. [2020-11-30 00:44:53,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:53,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:53,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2020-11-30 00:44:53,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:53,115 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-11-30 00:44:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2020-11-30 00:44:53,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-11-30 00:44:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-30 00:44:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-11-30 00:44:53,117 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-11-30 00:44:53,117 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-11-30 00:44:53,117 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-11-30 00:44:53,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 37 transitions. [2020-11-30 00:44:53,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:53,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:53,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:53,119 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [16, 15, 1] [2020-11-30 00:44:53,119 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:53,119 INFO L794 eck$LassoCheckResult]: Stem: 2085#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2081#L12-2 assume !!(main_~i~0 < main_~j~0); 2082#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2083#L12-2 assume !!(main_~i~0 < main_~j~0); 2084#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2088#L12-2 assume !!(main_~i~0 < main_~j~0); 2115#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2114#L12-2 assume !!(main_~i~0 < main_~j~0); 2113#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2112#L12-2 assume !!(main_~i~0 < main_~j~0); 2111#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2110#L12-2 assume !!(main_~i~0 < main_~j~0); 2109#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2108#L12-2 assume !!(main_~i~0 < main_~j~0); 2107#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2106#L12-2 assume !!(main_~i~0 < main_~j~0); 2105#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2104#L12-2 assume !!(main_~i~0 < main_~j~0); 2103#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2102#L12-2 assume !!(main_~i~0 < main_~j~0); 2101#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2100#L12-2 assume !!(main_~i~0 < main_~j~0); 2099#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2098#L12-2 assume !!(main_~i~0 < main_~j~0); 2097#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2096#L12-2 assume !!(main_~i~0 < main_~j~0); 2095#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2094#L12-2 assume !!(main_~i~0 < main_~j~0); 2092#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2091#L12-2 assume !!(main_~i~0 < main_~j~0); 2090#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2089#L12-2 assume !!(main_~i~0 < main_~j~0); 2086#L12 [2020-11-30 00:44:53,121 INFO L796 eck$LassoCheckResult]: Loop: 2086#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 2087#L12-2 assume !!(main_~i~0 < main_~j~0); 2090#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2089#L12-2 assume !!(main_~i~0 < main_~j~0); 2086#L12 [2020-11-30 00:44:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:53,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1085157027, now seen corresponding path program 15 times [2020-11-30 00:44:53,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:53,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631760514] [2020-11-30 00:44:53,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:53,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:53,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:53,141 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:53,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:53,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 13 times [2020-11-30 00:44:53,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:53,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544187451] [2020-11-30 00:44:53,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:53,145 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:53,150 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:53,151 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:53,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:53,153 INFO L82 PathProgramCache]: Analyzing trace with hash 891736981, now seen corresponding path program 15 times [2020-11-30 00:44:53,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:53,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961472694] [2020-11-30 00:44:53,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:53,426 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:53,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961472694] [2020-11-30 00:44:53,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866293669] [2020-11-30 00:44:53,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:53,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2020-11-30 00:44:53,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:53,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 00:44:53,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:53,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:53,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2020-11-30 00:44:53,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14689398] [2020-11-30 00:44:53,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:53,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-30 00:44:53,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2020-11-30 00:44:53,574 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. cyclomatic complexity: 3 Second operand 18 states. [2020-11-30 00:44:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:53,639 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-11-30 00:44:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 00:44:53,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 41 transitions. [2020-11-30 00:44:53,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:53,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 40 transitions. [2020-11-30 00:44:53,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:53,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:53,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 40 transitions. [2020-11-30 00:44:53,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:53,641 INFO L691 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2020-11-30 00:44:53,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 40 transitions. [2020-11-30 00:44:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-11-30 00:44:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-30 00:44:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-11-30 00:44:53,645 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-11-30 00:44:53,645 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-11-30 00:44:53,645 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-11-30 00:44:53,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 39 transitions. [2020-11-30 00:44:53,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:53,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:53,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:53,646 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [17, 16, 1] [2020-11-30 00:44:53,646 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:53,647 INFO L794 eck$LassoCheckResult]: Stem: 2287#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2283#L12-2 assume !!(main_~i~0 < main_~j~0); 2284#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2285#L12-2 assume !!(main_~i~0 < main_~j~0); 2286#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2290#L12-2 assume !!(main_~i~0 < main_~j~0); 2319#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2318#L12-2 assume !!(main_~i~0 < main_~j~0); 2317#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2316#L12-2 assume !!(main_~i~0 < main_~j~0); 2315#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2314#L12-2 assume !!(main_~i~0 < main_~j~0); 2313#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2312#L12-2 assume !!(main_~i~0 < main_~j~0); 2311#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2310#L12-2 assume !!(main_~i~0 < main_~j~0); 2309#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2308#L12-2 assume !!(main_~i~0 < main_~j~0); 2307#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2306#L12-2 assume !!(main_~i~0 < main_~j~0); 2305#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2304#L12-2 assume !!(main_~i~0 < main_~j~0); 2303#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2302#L12-2 assume !!(main_~i~0 < main_~j~0); 2301#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2300#L12-2 assume !!(main_~i~0 < main_~j~0); 2299#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2298#L12-2 assume !!(main_~i~0 < main_~j~0); 2297#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2296#L12-2 assume !!(main_~i~0 < main_~j~0); 2294#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2293#L12-2 assume !!(main_~i~0 < main_~j~0); 2292#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2291#L12-2 assume !!(main_~i~0 < main_~j~0); 2288#L12 [2020-11-30 00:44:53,647 INFO L796 eck$LassoCheckResult]: Loop: 2288#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 2289#L12-2 assume !!(main_~i~0 < main_~j~0); 2292#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2291#L12-2 assume !!(main_~i~0 < main_~j~0); 2288#L12 [2020-11-30 00:44:53,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:53,647 INFO L82 PathProgramCache]: Analyzing trace with hash 841150394, now seen corresponding path program 16 times [2020-11-30 00:44:53,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:53,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144335694] [2020-11-30 00:44:53,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:53,657 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:53,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:53,668 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:53,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:53,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 14 times [2020-11-30 00:44:53,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:53,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880006570] [2020-11-30 00:44:53,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:53,672 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:53,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:53,674 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:53,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash -2091418766, now seen corresponding path program 16 times [2020-11-30 00:44:53,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:53,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069911070] [2020-11-30 00:44:53,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 51 proven. 272 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:53,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069911070] [2020-11-30 00:44:53,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607917782] [2020-11-30 00:44:53,944 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:53,979 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 00:44:53,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:53,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-30 00:44:53,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:54,010 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 51 proven. 272 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:54,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:54,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2020-11-30 00:44:54,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176643293] [2020-11-30 00:44:54,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:54,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 00:44:54,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2020-11-30 00:44:54,064 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. cyclomatic complexity: 3 Second operand 19 states. [2020-11-30 00:44:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:54,126 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-11-30 00:44:54,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-30 00:44:54,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2020-11-30 00:44:54,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:54,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 42 transitions. [2020-11-30 00:44:54,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:54,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:54,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 42 transitions. [2020-11-30 00:44:54,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:54,129 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 42 transitions. [2020-11-30 00:44:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 42 transitions. [2020-11-30 00:44:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-11-30 00:44:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-30 00:44:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-11-30 00:44:54,132 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-11-30 00:44:54,132 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-11-30 00:44:54,132 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-11-30 00:44:54,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2020-11-30 00:44:54,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:54,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:54,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:54,134 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [18, 17, 1] [2020-11-30 00:44:54,134 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:54,134 INFO L794 eck$LassoCheckResult]: Stem: 2500#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2496#L12-2 assume !!(main_~i~0 < main_~j~0); 2497#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2498#L12-2 assume !!(main_~i~0 < main_~j~0); 2499#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2503#L12-2 assume !!(main_~i~0 < main_~j~0); 2534#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2533#L12-2 assume !!(main_~i~0 < main_~j~0); 2532#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2531#L12-2 assume !!(main_~i~0 < main_~j~0); 2530#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2529#L12-2 assume !!(main_~i~0 < main_~j~0); 2528#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2527#L12-2 assume !!(main_~i~0 < main_~j~0); 2526#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2525#L12-2 assume !!(main_~i~0 < main_~j~0); 2524#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2523#L12-2 assume !!(main_~i~0 < main_~j~0); 2522#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2521#L12-2 assume !!(main_~i~0 < main_~j~0); 2520#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2519#L12-2 assume !!(main_~i~0 < main_~j~0); 2518#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2517#L12-2 assume !!(main_~i~0 < main_~j~0); 2516#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2515#L12-2 assume !!(main_~i~0 < main_~j~0); 2514#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2513#L12-2 assume !!(main_~i~0 < main_~j~0); 2512#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2511#L12-2 assume !!(main_~i~0 < main_~j~0); 2510#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2509#L12-2 assume !!(main_~i~0 < main_~j~0); 2507#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2506#L12-2 assume !!(main_~i~0 < main_~j~0); 2505#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2504#L12-2 assume !!(main_~i~0 < main_~j~0); 2501#L12 [2020-11-30 00:44:54,134 INFO L796 eck$LassoCheckResult]: Loop: 2501#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 2502#L12-2 assume !!(main_~i~0 < main_~j~0); 2505#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2504#L12-2 assume !!(main_~i~0 < main_~j~0); 2501#L12 [2020-11-30 00:44:54,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:54,135 INFO L82 PathProgramCache]: Analyzing trace with hash 891677399, now seen corresponding path program 17 times [2020-11-30 00:44:54,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:54,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140897177] [2020-11-30 00:44:54,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:54,168 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:54,192 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:54,195 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:54,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 15 times [2020-11-30 00:44:54,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:54,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370180214] [2020-11-30 00:44:54,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:54,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:54,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:54,206 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:54,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:54,207 INFO L82 PathProgramCache]: Analyzing trace with hash 134062095, now seen corresponding path program 17 times [2020-11-30 00:44:54,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:54,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734600108] [2020-11-30 00:44:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:54,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734600108] [2020-11-30 00:44:54,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031457803] [2020-11-30 00:44:54,564 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:54,622 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2020-11-30 00:44:54,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:54,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-30 00:44:54,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:54,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:54,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2020-11-30 00:44:54,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837318849] [2020-11-30 00:44:54,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:54,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-30 00:44:54,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2020-11-30 00:44:54,708 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 3 Second operand 20 states. [2020-11-30 00:44:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:54,778 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-11-30 00:44:54,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-30 00:44:54,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 45 transitions. [2020-11-30 00:44:54,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:54,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 44 transitions. [2020-11-30 00:44:54,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:54,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:54,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2020-11-30 00:44:54,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:54,781 INFO L691 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-11-30 00:44:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2020-11-30 00:44:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-11-30 00:44:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-30 00:44:54,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2020-11-30 00:44:54,784 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-11-30 00:44:54,784 INFO L594 BuchiCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-11-30 00:44:54,784 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-11-30 00:44:54,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 43 transitions. [2020-11-30 00:44:54,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:54,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:54,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:54,785 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [19, 18, 1] [2020-11-30 00:44:54,785 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:54,786 INFO L794 eck$LassoCheckResult]: Stem: 2724#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2720#L12-2 assume !!(main_~i~0 < main_~j~0); 2721#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2722#L12-2 assume !!(main_~i~0 < main_~j~0); 2723#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2727#L12-2 assume !!(main_~i~0 < main_~j~0); 2760#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2759#L12-2 assume !!(main_~i~0 < main_~j~0); 2758#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2757#L12-2 assume !!(main_~i~0 < main_~j~0); 2756#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2755#L12-2 assume !!(main_~i~0 < main_~j~0); 2754#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2753#L12-2 assume !!(main_~i~0 < main_~j~0); 2752#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2751#L12-2 assume !!(main_~i~0 < main_~j~0); 2750#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2749#L12-2 assume !!(main_~i~0 < main_~j~0); 2748#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2747#L12-2 assume !!(main_~i~0 < main_~j~0); 2746#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2745#L12-2 assume !!(main_~i~0 < main_~j~0); 2744#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2743#L12-2 assume !!(main_~i~0 < main_~j~0); 2742#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2741#L12-2 assume !!(main_~i~0 < main_~j~0); 2740#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2739#L12-2 assume !!(main_~i~0 < main_~j~0); 2738#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2737#L12-2 assume !!(main_~i~0 < main_~j~0); 2736#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2735#L12-2 assume !!(main_~i~0 < main_~j~0); 2734#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2733#L12-2 assume !!(main_~i~0 < main_~j~0); 2731#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2730#L12-2 assume !!(main_~i~0 < main_~j~0); 2729#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2728#L12-2 assume !!(main_~i~0 < main_~j~0); 2725#L12 [2020-11-30 00:44:54,786 INFO L796 eck$LassoCheckResult]: Loop: 2725#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 2726#L12-2 assume !!(main_~i~0 < main_~j~0); 2729#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2728#L12-2 assume !!(main_~i~0 < main_~j~0); 2725#L12 [2020-11-30 00:44:54,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:54,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2091478348, now seen corresponding path program 18 times [2020-11-30 00:44:54,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:54,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746774456] [2020-11-30 00:44:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:54,797 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:54,807 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:54,809 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:54,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:54,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 16 times [2020-11-30 00:44:54,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:54,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407170344] [2020-11-30 00:44:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:54,813 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:54,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:54,815 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:54,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:54,816 INFO L82 PathProgramCache]: Analyzing trace with hash -72543892, now seen corresponding path program 18 times [2020-11-30 00:44:54,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:54,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212892873] [2020-11-30 00:44:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 342 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:55,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212892873] [2020-11-30 00:44:55,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017433315] [2020-11-30 00:44:55,180 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:55,218 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2020-11-30 00:44:55,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:55,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-30 00:44:55,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 342 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:55,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:55,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2020-11-30 00:44:55,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325300637] [2020-11-30 00:44:55,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:55,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-30 00:44:55,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2020-11-30 00:44:55,334 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. cyclomatic complexity: 3 Second operand 21 states. [2020-11-30 00:44:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:55,425 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-11-30 00:44:55,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-30 00:44:55,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 47 transitions. [2020-11-30 00:44:55,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:55,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 44 states and 46 transitions. [2020-11-30 00:44:55,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:55,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:55,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 46 transitions. [2020-11-30 00:44:55,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:55,427 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 46 transitions. [2020-11-30 00:44:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 46 transitions. [2020-11-30 00:44:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-11-30 00:44:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-30 00:44:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2020-11-30 00:44:55,437 INFO L714 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2020-11-30 00:44:55,437 INFO L594 BuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2020-11-30 00:44:55,437 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-11-30 00:44:55,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 45 transitions. [2020-11-30 00:44:55,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:55,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:55,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:55,442 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [20, 19, 1] [2020-11-30 00:44:55,445 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:55,447 INFO L794 eck$LassoCheckResult]: Stem: 2959#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 2955#L12-2 assume !!(main_~i~0 < main_~j~0); 2956#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2957#L12-2 assume !!(main_~i~0 < main_~j~0); 2958#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2962#L12-2 assume !!(main_~i~0 < main_~j~0); 2997#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2996#L12-2 assume !!(main_~i~0 < main_~j~0); 2995#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2994#L12-2 assume !!(main_~i~0 < main_~j~0); 2993#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2992#L12-2 assume !!(main_~i~0 < main_~j~0); 2991#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2990#L12-2 assume !!(main_~i~0 < main_~j~0); 2989#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2988#L12-2 assume !!(main_~i~0 < main_~j~0); 2987#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2986#L12-2 assume !!(main_~i~0 < main_~j~0); 2985#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2984#L12-2 assume !!(main_~i~0 < main_~j~0); 2983#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2982#L12-2 assume !!(main_~i~0 < main_~j~0); 2981#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2980#L12-2 assume !!(main_~i~0 < main_~j~0); 2979#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2978#L12-2 assume !!(main_~i~0 < main_~j~0); 2977#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2976#L12-2 assume !!(main_~i~0 < main_~j~0); 2975#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2974#L12-2 assume !!(main_~i~0 < main_~j~0); 2973#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2972#L12-2 assume !!(main_~i~0 < main_~j~0); 2971#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2970#L12-2 assume !!(main_~i~0 < main_~j~0); 2969#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2968#L12-2 assume !!(main_~i~0 < main_~j~0); 2966#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2965#L12-2 assume !!(main_~i~0 < main_~j~0); 2964#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2963#L12-2 assume !!(main_~i~0 < main_~j~0); 2960#L12 [2020-11-30 00:44:55,447 INFO L796 eck$LassoCheckResult]: Loop: 2960#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 2961#L12-2 assume !!(main_~i~0 < main_~j~0); 2964#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 2963#L12-2 assume !!(main_~i~0 < main_~j~0); 2960#L12 [2020-11-30 00:44:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:55,448 INFO L82 PathProgramCache]: Analyzing trace with hash 134002513, now seen corresponding path program 19 times [2020-11-30 00:44:55,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:55,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522704627] [2020-11-30 00:44:55,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:55,472 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:55,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:55,492 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:55,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:55,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 17 times [2020-11-30 00:44:55,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:55,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028112661] [2020-11-30 00:44:55,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:55,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:55,502 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:55,503 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:55,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:55,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1052401783, now seen corresponding path program 19 times [2020-11-30 00:44:55,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:55,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592929276] [2020-11-30 00:44:55,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:55,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592929276] [2020-11-30 00:44:55,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294555715] [2020-11-30 00:44:55,948 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:55,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-30 00:44:55,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:56,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:56,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2020-11-30 00:44:56,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772223478] [2020-11-30 00:44:56,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:56,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 00:44:56,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2020-11-30 00:44:56,098 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. cyclomatic complexity: 3 Second operand 22 states. [2020-11-30 00:44:56,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:56,178 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2020-11-30 00:44:56,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-30 00:44:56,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 49 transitions. [2020-11-30 00:44:56,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:56,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 46 states and 48 transitions. [2020-11-30 00:44:56,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:56,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:56,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 48 transitions. [2020-11-30 00:44:56,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:56,180 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-11-30 00:44:56,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 48 transitions. [2020-11-30 00:44:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-11-30 00:44:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-30 00:44:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2020-11-30 00:44:56,182 INFO L714 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2020-11-30 00:44:56,182 INFO L594 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2020-11-30 00:44:56,182 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-11-30 00:44:56,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 47 transitions. [2020-11-30 00:44:56,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:56,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:56,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:56,184 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [21, 20, 1] [2020-11-30 00:44:56,184 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:56,184 INFO L794 eck$LassoCheckResult]: Stem: 3205#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 3201#L12-2 assume !!(main_~i~0 < main_~j~0); 3202#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3203#L12-2 assume !!(main_~i~0 < main_~j~0); 3204#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3208#L12-2 assume !!(main_~i~0 < main_~j~0); 3245#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3244#L12-2 assume !!(main_~i~0 < main_~j~0); 3243#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3242#L12-2 assume !!(main_~i~0 < main_~j~0); 3241#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3240#L12-2 assume !!(main_~i~0 < main_~j~0); 3239#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3238#L12-2 assume !!(main_~i~0 < main_~j~0); 3237#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3236#L12-2 assume !!(main_~i~0 < main_~j~0); 3235#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3234#L12-2 assume !!(main_~i~0 < main_~j~0); 3233#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3232#L12-2 assume !!(main_~i~0 < main_~j~0); 3231#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3230#L12-2 assume !!(main_~i~0 < main_~j~0); 3229#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3228#L12-2 assume !!(main_~i~0 < main_~j~0); 3227#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3226#L12-2 assume !!(main_~i~0 < main_~j~0); 3225#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3224#L12-2 assume !!(main_~i~0 < main_~j~0); 3223#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3222#L12-2 assume !!(main_~i~0 < main_~j~0); 3221#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3220#L12-2 assume !!(main_~i~0 < main_~j~0); 3219#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3218#L12-2 assume !!(main_~i~0 < main_~j~0); 3217#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3216#L12-2 assume !!(main_~i~0 < main_~j~0); 3215#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3214#L12-2 assume !!(main_~i~0 < main_~j~0); 3212#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3211#L12-2 assume !!(main_~i~0 < main_~j~0); 3210#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3209#L12-2 assume !!(main_~i~0 < main_~j~0); 3206#L12 [2020-11-30 00:44:56,184 INFO L796 eck$LassoCheckResult]: Loop: 3206#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 3207#L12-2 assume !!(main_~i~0 < main_~j~0); 3210#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3209#L12-2 assume !!(main_~i~0 < main_~j~0); 3206#L12 [2020-11-30 00:44:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:56,184 INFO L82 PathProgramCache]: Analyzing trace with hash -72603474, now seen corresponding path program 20 times [2020-11-30 00:44:56,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:56,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909769356] [2020-11-30 00:44:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:56,197 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:56,210 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:56,213 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:56,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 18 times [2020-11-30 00:44:56,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:56,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746646777] [2020-11-30 00:44:56,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:56,217 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:56,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:56,220 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:56,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:56,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2097997210, now seen corresponding path program 20 times [2020-11-30 00:44:56,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:56,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356720287] [2020-11-30 00:44:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 63 proven. 420 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:56,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356720287] [2020-11-30 00:44:56,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324137909] [2020-11-30 00:44:56,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:56,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:44:56,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:56,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2020-11-30 00:44:56,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 63 proven. 420 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:56,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:56,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2020-11-30 00:44:56,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755828302] [2020-11-30 00:44:56,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:56,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-30 00:44:56,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2020-11-30 00:44:56,859 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. cyclomatic complexity: 3 Second operand 23 states. [2020-11-30 00:44:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:56,937 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-11-30 00:44:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-30 00:44:56,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 51 transitions. [2020-11-30 00:44:56,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:56,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 50 transitions. [2020-11-30 00:44:56,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:56,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:56,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 50 transitions. [2020-11-30 00:44:56,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:56,940 INFO L691 BuchiCegarLoop]: Abstraction has 48 states and 50 transitions. [2020-11-30 00:44:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 50 transitions. [2020-11-30 00:44:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-11-30 00:44:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-30 00:44:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2020-11-30 00:44:56,943 INFO L714 BuchiCegarLoop]: Abstraction has 47 states and 49 transitions. [2020-11-30 00:44:56,943 INFO L594 BuchiCegarLoop]: Abstraction has 47 states and 49 transitions. [2020-11-30 00:44:56,943 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-11-30 00:44:56,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 49 transitions. [2020-11-30 00:44:56,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:56,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:56,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:56,945 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [22, 21, 1] [2020-11-30 00:44:56,945 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:56,946 INFO L794 eck$LassoCheckResult]: Stem: 3462#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 3458#L12-2 assume !!(main_~i~0 < main_~j~0); 3459#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3460#L12-2 assume !!(main_~i~0 < main_~j~0); 3461#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3465#L12-2 assume !!(main_~i~0 < main_~j~0); 3504#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3503#L12-2 assume !!(main_~i~0 < main_~j~0); 3502#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3501#L12-2 assume !!(main_~i~0 < main_~j~0); 3500#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3499#L12-2 assume !!(main_~i~0 < main_~j~0); 3498#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3497#L12-2 assume !!(main_~i~0 < main_~j~0); 3496#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3495#L12-2 assume !!(main_~i~0 < main_~j~0); 3494#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3493#L12-2 assume !!(main_~i~0 < main_~j~0); 3492#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3491#L12-2 assume !!(main_~i~0 < main_~j~0); 3490#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3489#L12-2 assume !!(main_~i~0 < main_~j~0); 3488#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3487#L12-2 assume !!(main_~i~0 < main_~j~0); 3486#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3485#L12-2 assume !!(main_~i~0 < main_~j~0); 3484#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3483#L12-2 assume !!(main_~i~0 < main_~j~0); 3482#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3481#L12-2 assume !!(main_~i~0 < main_~j~0); 3480#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3479#L12-2 assume !!(main_~i~0 < main_~j~0); 3478#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3477#L12-2 assume !!(main_~i~0 < main_~j~0); 3476#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3475#L12-2 assume !!(main_~i~0 < main_~j~0); 3474#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3473#L12-2 assume !!(main_~i~0 < main_~j~0); 3472#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3471#L12-2 assume !!(main_~i~0 < main_~j~0); 3469#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3468#L12-2 assume !!(main_~i~0 < main_~j~0); 3467#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3466#L12-2 assume !!(main_~i~0 < main_~j~0); 3463#L12 [2020-11-30 00:44:56,946 INFO L796 eck$LassoCheckResult]: Loop: 3463#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 3464#L12-2 assume !!(main_~i~0 < main_~j~0); 3467#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3466#L12-2 assume !!(main_~i~0 < main_~j~0); 3463#L12 [2020-11-30 00:44:56,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:56,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1052461365, now seen corresponding path program 21 times [2020-11-30 00:44:56,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:56,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274793808] [2020-11-30 00:44:56,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:56,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:56,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:56,972 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:56,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:56,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 19 times [2020-11-30 00:44:56,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:56,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168377641] [2020-11-30 00:44:56,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:56,976 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:56,977 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:56,978 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:56,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:56,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1892855293, now seen corresponding path program 21 times [2020-11-30 00:44:56,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:56,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462189551] [2020-11-30 00:44:56,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 66 proven. 462 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:57,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462189551] [2020-11-30 00:44:57,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130020012] [2020-11-30 00:44:57,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:57,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2020-11-30 00:44:57,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:57,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjunts are in the unsatisfiable core [2020-11-30 00:44:57,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 66 proven. 462 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:57,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:57,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2020-11-30 00:44:57,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083183297] [2020-11-30 00:44:57,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:57,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-30 00:44:57,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2020-11-30 00:44:57,610 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. cyclomatic complexity: 3 Second operand 24 states. [2020-11-30 00:44:57,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:57,738 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2020-11-30 00:44:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-30 00:44:57,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 53 transitions. [2020-11-30 00:44:57,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:57,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 50 states and 52 transitions. [2020-11-30 00:44:57,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:57,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:57,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 52 transitions. [2020-11-30 00:44:57,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:57,742 INFO L691 BuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2020-11-30 00:44:57,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 52 transitions. [2020-11-30 00:44:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2020-11-30 00:44:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-30 00:44:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-11-30 00:44:57,744 INFO L714 BuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-11-30 00:44:57,744 INFO L594 BuchiCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-11-30 00:44:57,744 INFO L427 BuchiCegarLoop]: ======== Iteration 24============ [2020-11-30 00:44:57,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 51 transitions. [2020-11-30 00:44:57,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:57,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:57,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:57,746 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [23, 22, 1] [2020-11-30 00:44:57,746 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:57,747 INFO L794 eck$LassoCheckResult]: Stem: 3730#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 3726#L12-2 assume !!(main_~i~0 < main_~j~0); 3727#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3728#L12-2 assume !!(main_~i~0 < main_~j~0); 3729#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3733#L12-2 assume !!(main_~i~0 < main_~j~0); 3774#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3773#L12-2 assume !!(main_~i~0 < main_~j~0); 3772#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3771#L12-2 assume !!(main_~i~0 < main_~j~0); 3770#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3769#L12-2 assume !!(main_~i~0 < main_~j~0); 3768#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3767#L12-2 assume !!(main_~i~0 < main_~j~0); 3766#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3765#L12-2 assume !!(main_~i~0 < main_~j~0); 3764#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3763#L12-2 assume !!(main_~i~0 < main_~j~0); 3762#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3761#L12-2 assume !!(main_~i~0 < main_~j~0); 3760#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3759#L12-2 assume !!(main_~i~0 < main_~j~0); 3758#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3757#L12-2 assume !!(main_~i~0 < main_~j~0); 3756#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3755#L12-2 assume !!(main_~i~0 < main_~j~0); 3754#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3753#L12-2 assume !!(main_~i~0 < main_~j~0); 3752#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3751#L12-2 assume !!(main_~i~0 < main_~j~0); 3750#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3749#L12-2 assume !!(main_~i~0 < main_~j~0); 3748#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3747#L12-2 assume !!(main_~i~0 < main_~j~0); 3746#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3745#L12-2 assume !!(main_~i~0 < main_~j~0); 3744#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3743#L12-2 assume !!(main_~i~0 < main_~j~0); 3742#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3741#L12-2 assume !!(main_~i~0 < main_~j~0); 3740#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3739#L12-2 assume !!(main_~i~0 < main_~j~0); 3737#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3736#L12-2 assume !!(main_~i~0 < main_~j~0); 3735#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3734#L12-2 assume !!(main_~i~0 < main_~j~0); 3731#L12 [2020-11-30 00:44:57,747 INFO L796 eck$LassoCheckResult]: Loop: 3731#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 3732#L12-2 assume !!(main_~i~0 < main_~j~0); 3735#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 3734#L12-2 assume !!(main_~i~0 < main_~j~0); 3731#L12 [2020-11-30 00:44:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2098056792, now seen corresponding path program 22 times [2020-11-30 00:44:57,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:57,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669646617] [2020-11-30 00:44:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:57,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:57,789 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:57,791 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:57,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:57,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 20 times [2020-11-30 00:44:57,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:57,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398648459] [2020-11-30 00:44:57,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:57,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:57,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:57,799 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:57,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1974998624, now seen corresponding path program 22 times [2020-11-30 00:44:57,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:57,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149042719] [2020-11-30 00:44:57,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:58,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149042719] [2020-11-30 00:44:58,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014457797] [2020-11-30 00:44:58,339 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:58,386 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 00:44:58,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:58,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjunts are in the unsatisfiable core [2020-11-30 00:44:58,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 69 proven. 506 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:58,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:58,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2020-11-30 00:44:58,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837971587] [2020-11-30 00:44:58,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:58,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-30 00:44:58,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2020-11-30 00:44:58,494 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. cyclomatic complexity: 3 Second operand 25 states. [2020-11-30 00:44:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:58,606 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-11-30 00:44:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-30 00:44:58,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 55 transitions. [2020-11-30 00:44:58,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:58,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 52 states and 54 transitions. [2020-11-30 00:44:58,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:58,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:58,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 54 transitions. [2020-11-30 00:44:58,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:58,608 INFO L691 BuchiCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-11-30 00:44:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 54 transitions. [2020-11-30 00:44:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2020-11-30 00:44:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-30 00:44:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-11-30 00:44:58,611 INFO L714 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-11-30 00:44:58,611 INFO L594 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-11-30 00:44:58,611 INFO L427 BuchiCegarLoop]: ======== Iteration 25============ [2020-11-30 00:44:58,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 53 transitions. [2020-11-30 00:44:58,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:58,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:58,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:58,613 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [24, 23, 1] [2020-11-30 00:44:58,613 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:58,614 INFO L794 eck$LassoCheckResult]: Stem: 4009#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 4005#L12-2 assume !!(main_~i~0 < main_~j~0); 4006#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4007#L12-2 assume !!(main_~i~0 < main_~j~0); 4008#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4012#L12-2 assume !!(main_~i~0 < main_~j~0); 4055#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4054#L12-2 assume !!(main_~i~0 < main_~j~0); 4053#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4052#L12-2 assume !!(main_~i~0 < main_~j~0); 4051#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4050#L12-2 assume !!(main_~i~0 < main_~j~0); 4049#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4048#L12-2 assume !!(main_~i~0 < main_~j~0); 4047#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4046#L12-2 assume !!(main_~i~0 < main_~j~0); 4045#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4044#L12-2 assume !!(main_~i~0 < main_~j~0); 4043#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4042#L12-2 assume !!(main_~i~0 < main_~j~0); 4041#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4040#L12-2 assume !!(main_~i~0 < main_~j~0); 4039#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4038#L12-2 assume !!(main_~i~0 < main_~j~0); 4037#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4036#L12-2 assume !!(main_~i~0 < main_~j~0); 4035#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4034#L12-2 assume !!(main_~i~0 < main_~j~0); 4033#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4032#L12-2 assume !!(main_~i~0 < main_~j~0); 4031#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4030#L12-2 assume !!(main_~i~0 < main_~j~0); 4029#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4028#L12-2 assume !!(main_~i~0 < main_~j~0); 4027#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4026#L12-2 assume !!(main_~i~0 < main_~j~0); 4025#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4024#L12-2 assume !!(main_~i~0 < main_~j~0); 4023#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4022#L12-2 assume !!(main_~i~0 < main_~j~0); 4021#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4020#L12-2 assume !!(main_~i~0 < main_~j~0); 4019#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4018#L12-2 assume !!(main_~i~0 < main_~j~0); 4016#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4015#L12-2 assume !!(main_~i~0 < main_~j~0); 4014#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4013#L12-2 assume !!(main_~i~0 < main_~j~0); 4010#L12 [2020-11-30 00:44:58,614 INFO L796 eck$LassoCheckResult]: Loop: 4010#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 4011#L12-2 assume !!(main_~i~0 < main_~j~0); 4014#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4013#L12-2 assume !!(main_~i~0 < main_~j~0); 4010#L12 [2020-11-30 00:44:58,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:58,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1892914875, now seen corresponding path program 23 times [2020-11-30 00:44:58,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:58,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361924203] [2020-11-30 00:44:58,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:58,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:58,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:58,658 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:58,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:58,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 21 times [2020-11-30 00:44:58,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:58,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212302802] [2020-11-30 00:44:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:58,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:58,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:58,665 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:58,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:58,665 INFO L82 PathProgramCache]: Analyzing trace with hash -459065475, now seen corresponding path program 23 times [2020-11-30 00:44:58,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:58,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350182085] [2020-11-30 00:44:58,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:44:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 72 proven. 552 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:59,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350182085] [2020-11-30 00:44:59,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237494219] [2020-11-30 00:44:59,229 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:44:59,277 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2020-11-30 00:44:59,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:44:59,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-30 00:44:59,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:44:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 72 proven. 552 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:44:59,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:44:59,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2020-11-30 00:44:59,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251835266] [2020-11-30 00:44:59,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:44:59,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-30 00:44:59,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2020-11-30 00:44:59,382 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. cyclomatic complexity: 3 Second operand 26 states. [2020-11-30 00:44:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:44:59,504 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-11-30 00:44:59,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-30 00:44:59,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 57 transitions. [2020-11-30 00:44:59,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:59,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 56 transitions. [2020-11-30 00:44:59,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:44:59,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:44:59,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 56 transitions. [2020-11-30 00:44:59,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:44:59,512 INFO L691 BuchiCegarLoop]: Abstraction has 54 states and 56 transitions. [2020-11-30 00:44:59,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 56 transitions. [2020-11-30 00:44:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2020-11-30 00:44:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-30 00:44:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-11-30 00:44:59,515 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-11-30 00:44:59,515 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-11-30 00:44:59,515 INFO L427 BuchiCegarLoop]: ======== Iteration 26============ [2020-11-30 00:44:59,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 55 transitions. [2020-11-30 00:44:59,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:44:59,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:44:59,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:44:59,517 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [25, 24, 1] [2020-11-30 00:44:59,517 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:44:59,517 INFO L794 eck$LassoCheckResult]: Stem: 4299#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 4295#L12-2 assume !!(main_~i~0 < main_~j~0); 4296#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4297#L12-2 assume !!(main_~i~0 < main_~j~0); 4298#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4302#L12-2 assume !!(main_~i~0 < main_~j~0); 4347#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4346#L12-2 assume !!(main_~i~0 < main_~j~0); 4345#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4344#L12-2 assume !!(main_~i~0 < main_~j~0); 4343#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4342#L12-2 assume !!(main_~i~0 < main_~j~0); 4341#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4340#L12-2 assume !!(main_~i~0 < main_~j~0); 4339#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4338#L12-2 assume !!(main_~i~0 < main_~j~0); 4337#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4336#L12-2 assume !!(main_~i~0 < main_~j~0); 4335#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4334#L12-2 assume !!(main_~i~0 < main_~j~0); 4333#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4332#L12-2 assume !!(main_~i~0 < main_~j~0); 4331#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4330#L12-2 assume !!(main_~i~0 < main_~j~0); 4329#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4328#L12-2 assume !!(main_~i~0 < main_~j~0); 4327#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4326#L12-2 assume !!(main_~i~0 < main_~j~0); 4325#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4324#L12-2 assume !!(main_~i~0 < main_~j~0); 4323#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4322#L12-2 assume !!(main_~i~0 < main_~j~0); 4321#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4320#L12-2 assume !!(main_~i~0 < main_~j~0); 4319#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4318#L12-2 assume !!(main_~i~0 < main_~j~0); 4317#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4316#L12-2 assume !!(main_~i~0 < main_~j~0); 4315#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4314#L12-2 assume !!(main_~i~0 < main_~j~0); 4313#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4312#L12-2 assume !!(main_~i~0 < main_~j~0); 4311#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4310#L12-2 assume !!(main_~i~0 < main_~j~0); 4309#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4308#L12-2 assume !!(main_~i~0 < main_~j~0); 4306#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4305#L12-2 assume !!(main_~i~0 < main_~j~0); 4304#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4303#L12-2 assume !!(main_~i~0 < main_~j~0); 4300#L12 [2020-11-30 00:44:59,517 INFO L796 eck$LassoCheckResult]: Loop: 4300#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 4301#L12-2 assume !!(main_~i~0 < main_~j~0); 4304#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4303#L12-2 assume !!(main_~i~0 < main_~j~0); 4300#L12 [2020-11-30 00:44:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:59,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1974939042, now seen corresponding path program 24 times [2020-11-30 00:44:59,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:59,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106641738] [2020-11-30 00:44:59,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:59,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:59,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:59,546 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:59,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:59,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 22 times [2020-11-30 00:44:59,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:59,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309653281] [2020-11-30 00:44:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:59,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:44:59,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:44:59,552 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:44:59,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:44:59,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1162511706, now seen corresponding path program 24 times [2020-11-30 00:44:59,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:44:59,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542912416] [2020-11-30 00:44:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:44:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 75 proven. 600 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:00,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542912416] [2020-11-30 00:45:00,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731321703] [2020-11-30 00:45:00,251 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:00,309 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2020-11-30 00:45:00,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:00,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 26 conjunts are in the unsatisfiable core [2020-11-30 00:45:00,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 75 proven. 600 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:00,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:00,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2020-11-30 00:45:00,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521262931] [2020-11-30 00:45:00,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:00,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-30 00:45:00,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2020-11-30 00:45:00,420 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. cyclomatic complexity: 3 Second operand 27 states. [2020-11-30 00:45:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:00,568 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2020-11-30 00:45:00,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-30 00:45:00,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 59 transitions. [2020-11-30 00:45:00,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:00,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 58 transitions. [2020-11-30 00:45:00,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:00,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:00,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 58 transitions. [2020-11-30 00:45:00,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:00,571 INFO L691 BuchiCegarLoop]: Abstraction has 56 states and 58 transitions. [2020-11-30 00:45:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 58 transitions. [2020-11-30 00:45:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2020-11-30 00:45:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-30 00:45:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2020-11-30 00:45:00,573 INFO L714 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-11-30 00:45:00,574 INFO L594 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-11-30 00:45:00,574 INFO L427 BuchiCegarLoop]: ======== Iteration 27============ [2020-11-30 00:45:00,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 57 transitions. [2020-11-30 00:45:00,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:00,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:00,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:00,575 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [26, 25, 1] [2020-11-30 00:45:00,575 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:00,582 INFO L794 eck$LassoCheckResult]: Stem: 4600#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 4596#L12-2 assume !!(main_~i~0 < main_~j~0); 4597#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4598#L12-2 assume !!(main_~i~0 < main_~j~0); 4599#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4603#L12-2 assume !!(main_~i~0 < main_~j~0); 4650#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4649#L12-2 assume !!(main_~i~0 < main_~j~0); 4648#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4647#L12-2 assume !!(main_~i~0 < main_~j~0); 4646#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4645#L12-2 assume !!(main_~i~0 < main_~j~0); 4644#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4643#L12-2 assume !!(main_~i~0 < main_~j~0); 4642#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4641#L12-2 assume !!(main_~i~0 < main_~j~0); 4640#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4639#L12-2 assume !!(main_~i~0 < main_~j~0); 4638#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4637#L12-2 assume !!(main_~i~0 < main_~j~0); 4636#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4635#L12-2 assume !!(main_~i~0 < main_~j~0); 4634#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4633#L12-2 assume !!(main_~i~0 < main_~j~0); 4632#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4631#L12-2 assume !!(main_~i~0 < main_~j~0); 4630#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4629#L12-2 assume !!(main_~i~0 < main_~j~0); 4628#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4627#L12-2 assume !!(main_~i~0 < main_~j~0); 4626#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4625#L12-2 assume !!(main_~i~0 < main_~j~0); 4624#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4623#L12-2 assume !!(main_~i~0 < main_~j~0); 4622#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4621#L12-2 assume !!(main_~i~0 < main_~j~0); 4620#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4619#L12-2 assume !!(main_~i~0 < main_~j~0); 4618#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4617#L12-2 assume !!(main_~i~0 < main_~j~0); 4616#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4615#L12-2 assume !!(main_~i~0 < main_~j~0); 4614#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4613#L12-2 assume !!(main_~i~0 < main_~j~0); 4612#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4611#L12-2 assume !!(main_~i~0 < main_~j~0); 4610#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4609#L12-2 assume !!(main_~i~0 < main_~j~0); 4607#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4606#L12-2 assume !!(main_~i~0 < main_~j~0); 4605#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4604#L12-2 assume !!(main_~i~0 < main_~j~0); 4601#L12 [2020-11-30 00:45:00,582 INFO L796 eck$LassoCheckResult]: Loop: 4601#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 4602#L12-2 assume !!(main_~i~0 < main_~j~0); 4605#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4604#L12-2 assume !!(main_~i~0 < main_~j~0); 4601#L12 [2020-11-30 00:45:00,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:00,582 INFO L82 PathProgramCache]: Analyzing trace with hash -459125057, now seen corresponding path program 25 times [2020-11-30 00:45:00,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:00,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848177160] [2020-11-30 00:45:00,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:00,618 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:00,635 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:00,638 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:00,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:00,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 23 times [2020-11-30 00:45:00,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:00,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446755292] [2020-11-30 00:45:00,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:00,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:00,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:00,644 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash 425054199, now seen corresponding path program 25 times [2020-11-30 00:45:00,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:00,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847893364] [2020-11-30 00:45:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 78 proven. 650 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:01,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847893364] [2020-11-30 00:45:01,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238290177] [2020-11-30 00:45:01,257 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:01,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjunts are in the unsatisfiable core [2020-11-30 00:45:01,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 78 proven. 650 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:01,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:01,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2020-11-30 00:45:01,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680869274] [2020-11-30 00:45:01,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:01,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-30 00:45:01,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2020-11-30 00:45:01,421 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. cyclomatic complexity: 3 Second operand 28 states. [2020-11-30 00:45:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:01,553 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-11-30 00:45:01,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-30 00:45:01,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 61 transitions. [2020-11-30 00:45:01,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:01,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 58 states and 60 transitions. [2020-11-30 00:45:01,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:01,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:01,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 60 transitions. [2020-11-30 00:45:01,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:01,556 INFO L691 BuchiCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-11-30 00:45:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 60 transitions. [2020-11-30 00:45:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2020-11-30 00:45:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-30 00:45:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2020-11-30 00:45:01,558 INFO L714 BuchiCegarLoop]: Abstraction has 57 states and 59 transitions. [2020-11-30 00:45:01,558 INFO L594 BuchiCegarLoop]: Abstraction has 57 states and 59 transitions. [2020-11-30 00:45:01,558 INFO L427 BuchiCegarLoop]: ======== Iteration 28============ [2020-11-30 00:45:01,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 59 transitions. [2020-11-30 00:45:01,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:01,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:01,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:01,561 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [27, 26, 1] [2020-11-30 00:45:01,561 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:01,561 INFO L794 eck$LassoCheckResult]: Stem: 4912#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 4908#L12-2 assume !!(main_~i~0 < main_~j~0); 4909#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4910#L12-2 assume !!(main_~i~0 < main_~j~0); 4911#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4915#L12-2 assume !!(main_~i~0 < main_~j~0); 4964#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4963#L12-2 assume !!(main_~i~0 < main_~j~0); 4962#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4961#L12-2 assume !!(main_~i~0 < main_~j~0); 4960#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4959#L12-2 assume !!(main_~i~0 < main_~j~0); 4958#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4957#L12-2 assume !!(main_~i~0 < main_~j~0); 4956#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4955#L12-2 assume !!(main_~i~0 < main_~j~0); 4954#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4953#L12-2 assume !!(main_~i~0 < main_~j~0); 4952#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4951#L12-2 assume !!(main_~i~0 < main_~j~0); 4950#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4949#L12-2 assume !!(main_~i~0 < main_~j~0); 4948#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4947#L12-2 assume !!(main_~i~0 < main_~j~0); 4946#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4945#L12-2 assume !!(main_~i~0 < main_~j~0); 4944#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4943#L12-2 assume !!(main_~i~0 < main_~j~0); 4942#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4941#L12-2 assume !!(main_~i~0 < main_~j~0); 4940#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4939#L12-2 assume !!(main_~i~0 < main_~j~0); 4938#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4937#L12-2 assume !!(main_~i~0 < main_~j~0); 4936#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4935#L12-2 assume !!(main_~i~0 < main_~j~0); 4934#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4933#L12-2 assume !!(main_~i~0 < main_~j~0); 4932#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4931#L12-2 assume !!(main_~i~0 < main_~j~0); 4930#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4929#L12-2 assume !!(main_~i~0 < main_~j~0); 4928#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4927#L12-2 assume !!(main_~i~0 < main_~j~0); 4926#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4925#L12-2 assume !!(main_~i~0 < main_~j~0); 4924#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4923#L12-2 assume !!(main_~i~0 < main_~j~0); 4922#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4921#L12-2 assume !!(main_~i~0 < main_~j~0); 4919#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4918#L12-2 assume !!(main_~i~0 < main_~j~0); 4917#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4916#L12-2 assume !!(main_~i~0 < main_~j~0); 4913#L12 [2020-11-30 00:45:01,562 INFO L796 eck$LassoCheckResult]: Loop: 4913#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 4914#L12-2 assume !!(main_~i~0 < main_~j~0); 4917#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 4916#L12-2 assume !!(main_~i~0 < main_~j~0); 4913#L12 [2020-11-30 00:45:01,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:01,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1162452124, now seen corresponding path program 26 times [2020-11-30 00:45:01,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:01,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306968193] [2020-11-30 00:45:01,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:01,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:01,592 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:01,594 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:01,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:01,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 24 times [2020-11-30 00:45:01,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:01,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244654005] [2020-11-30 00:45:01,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:01,598 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:01,600 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:01,600 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash 397993812, now seen corresponding path program 26 times [2020-11-30 00:45:01,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:01,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672483614] [2020-11-30 00:45:01,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 81 proven. 702 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:02,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672483614] [2020-11-30 00:45:02,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537300434] [2020-11-30 00:45:02,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:02,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:45:02,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:02,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 28 conjunts are in the unsatisfiable core [2020-11-30 00:45:02,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 81 proven. 702 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:02,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:02,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2020-11-30 00:45:02,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49220431] [2020-11-30 00:45:02,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:02,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-30 00:45:02,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2020-11-30 00:45:02,404 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. cyclomatic complexity: 3 Second operand 29 states. [2020-11-30 00:45:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:02,529 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-11-30 00:45:02,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-30 00:45:02,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 63 transitions. [2020-11-30 00:45:02,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:02,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 60 states and 62 transitions. [2020-11-30 00:45:02,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:02,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:02,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 62 transitions. [2020-11-30 00:45:02,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:02,532 INFO L691 BuchiCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-11-30 00:45:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 62 transitions. [2020-11-30 00:45:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2020-11-30 00:45:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-30 00:45:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-11-30 00:45:02,534 INFO L714 BuchiCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-11-30 00:45:02,534 INFO L594 BuchiCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-11-30 00:45:02,534 INFO L427 BuchiCegarLoop]: ======== Iteration 29============ [2020-11-30 00:45:02,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 61 transitions. [2020-11-30 00:45:02,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:02,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:02,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:02,536 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [28, 27, 1] [2020-11-30 00:45:02,536 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:02,536 INFO L794 eck$LassoCheckResult]: Stem: 5235#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 5231#L12-2 assume !!(main_~i~0 < main_~j~0); 5232#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5233#L12-2 assume !!(main_~i~0 < main_~j~0); 5234#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5238#L12-2 assume !!(main_~i~0 < main_~j~0); 5289#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5288#L12-2 assume !!(main_~i~0 < main_~j~0); 5287#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5286#L12-2 assume !!(main_~i~0 < main_~j~0); 5285#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5284#L12-2 assume !!(main_~i~0 < main_~j~0); 5283#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5282#L12-2 assume !!(main_~i~0 < main_~j~0); 5281#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5280#L12-2 assume !!(main_~i~0 < main_~j~0); 5279#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5278#L12-2 assume !!(main_~i~0 < main_~j~0); 5277#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5276#L12-2 assume !!(main_~i~0 < main_~j~0); 5275#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5274#L12-2 assume !!(main_~i~0 < main_~j~0); 5273#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5272#L12-2 assume !!(main_~i~0 < main_~j~0); 5271#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5270#L12-2 assume !!(main_~i~0 < main_~j~0); 5269#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5268#L12-2 assume !!(main_~i~0 < main_~j~0); 5267#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5266#L12-2 assume !!(main_~i~0 < main_~j~0); 5265#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5264#L12-2 assume !!(main_~i~0 < main_~j~0); 5263#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5262#L12-2 assume !!(main_~i~0 < main_~j~0); 5261#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5260#L12-2 assume !!(main_~i~0 < main_~j~0); 5259#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5258#L12-2 assume !!(main_~i~0 < main_~j~0); 5257#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5256#L12-2 assume !!(main_~i~0 < main_~j~0); 5255#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5254#L12-2 assume !!(main_~i~0 < main_~j~0); 5253#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5252#L12-2 assume !!(main_~i~0 < main_~j~0); 5251#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5250#L12-2 assume !!(main_~i~0 < main_~j~0); 5249#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5248#L12-2 assume !!(main_~i~0 < main_~j~0); 5247#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5246#L12-2 assume !!(main_~i~0 < main_~j~0); 5245#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5244#L12-2 assume !!(main_~i~0 < main_~j~0); 5242#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5241#L12-2 assume !!(main_~i~0 < main_~j~0); 5240#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5239#L12-2 assume !!(main_~i~0 < main_~j~0); 5236#L12 [2020-11-30 00:45:02,536 INFO L796 eck$LassoCheckResult]: Loop: 5236#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 5237#L12-2 assume !!(main_~i~0 < main_~j~0); 5240#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5239#L12-2 assume !!(main_~i~0 < main_~j~0); 5236#L12 [2020-11-30 00:45:02,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:02,536 INFO L82 PathProgramCache]: Analyzing trace with hash 424994617, now seen corresponding path program 27 times [2020-11-30 00:45:02,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:02,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073648392] [2020-11-30 00:45:02,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:02,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:02,564 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:02,567 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 25 times [2020-11-30 00:45:02,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:02,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191913755] [2020-11-30 00:45:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:02,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:02,572 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:02,573 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:02,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:02,574 INFO L82 PathProgramCache]: Analyzing trace with hash 162765681, now seen corresponding path program 27 times [2020-11-30 00:45:02,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:02,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744948762] [2020-11-30 00:45:02,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 84 proven. 756 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:03,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744948762] [2020-11-30 00:45:03,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346952614] [2020-11-30 00:45:03,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:03,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2020-11-30 00:45:03,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:03,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 29 conjunts are in the unsatisfiable core [2020-11-30 00:45:03,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 84 proven. 756 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:03,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:03,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2020-11-30 00:45:03,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245267387] [2020-11-30 00:45:03,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-30 00:45:03,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2020-11-30 00:45:03,517 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. cyclomatic complexity: 3 Second operand 30 states. [2020-11-30 00:45:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:03,659 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2020-11-30 00:45:03,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-30 00:45:03,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2020-11-30 00:45:03,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:03,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 62 states and 64 transitions. [2020-11-30 00:45:03,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:03,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:03,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 64 transitions. [2020-11-30 00:45:03,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:03,661 INFO L691 BuchiCegarLoop]: Abstraction has 62 states and 64 transitions. [2020-11-30 00:45:03,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 64 transitions. [2020-11-30 00:45:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2020-11-30 00:45:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-30 00:45:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-11-30 00:45:03,662 INFO L714 BuchiCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-11-30 00:45:03,662 INFO L594 BuchiCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-11-30 00:45:03,662 INFO L427 BuchiCegarLoop]: ======== Iteration 30============ [2020-11-30 00:45:03,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 63 transitions. [2020-11-30 00:45:03,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:03,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:03,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:03,663 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [29, 28, 1] [2020-11-30 00:45:03,663 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:03,663 INFO L794 eck$LassoCheckResult]: Stem: 5569#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 5565#L12-2 assume !!(main_~i~0 < main_~j~0); 5566#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5567#L12-2 assume !!(main_~i~0 < main_~j~0); 5568#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5572#L12-2 assume !!(main_~i~0 < main_~j~0); 5625#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5624#L12-2 assume !!(main_~i~0 < main_~j~0); 5623#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5622#L12-2 assume !!(main_~i~0 < main_~j~0); 5621#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5620#L12-2 assume !!(main_~i~0 < main_~j~0); 5619#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5618#L12-2 assume !!(main_~i~0 < main_~j~0); 5617#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5616#L12-2 assume !!(main_~i~0 < main_~j~0); 5615#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5614#L12-2 assume !!(main_~i~0 < main_~j~0); 5613#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5612#L12-2 assume !!(main_~i~0 < main_~j~0); 5611#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5610#L12-2 assume !!(main_~i~0 < main_~j~0); 5609#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5608#L12-2 assume !!(main_~i~0 < main_~j~0); 5607#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5606#L12-2 assume !!(main_~i~0 < main_~j~0); 5605#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5604#L12-2 assume !!(main_~i~0 < main_~j~0); 5603#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5602#L12-2 assume !!(main_~i~0 < main_~j~0); 5601#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5600#L12-2 assume !!(main_~i~0 < main_~j~0); 5599#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5598#L12-2 assume !!(main_~i~0 < main_~j~0); 5597#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5596#L12-2 assume !!(main_~i~0 < main_~j~0); 5595#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5594#L12-2 assume !!(main_~i~0 < main_~j~0); 5593#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5592#L12-2 assume !!(main_~i~0 < main_~j~0); 5591#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5590#L12-2 assume !!(main_~i~0 < main_~j~0); 5589#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5588#L12-2 assume !!(main_~i~0 < main_~j~0); 5587#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5586#L12-2 assume !!(main_~i~0 < main_~j~0); 5585#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5584#L12-2 assume !!(main_~i~0 < main_~j~0); 5583#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5582#L12-2 assume !!(main_~i~0 < main_~j~0); 5581#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5580#L12-2 assume !!(main_~i~0 < main_~j~0); 5579#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5578#L12-2 assume !!(main_~i~0 < main_~j~0); 5576#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5575#L12-2 assume !!(main_~i~0 < main_~j~0); 5574#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5573#L12-2 assume !!(main_~i~0 < main_~j~0); 5570#L12 [2020-11-30 00:45:03,664 INFO L796 eck$LassoCheckResult]: Loop: 5570#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 5571#L12-2 assume !!(main_~i~0 < main_~j~0); 5574#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5573#L12-2 assume !!(main_~i~0 < main_~j~0); 5570#L12 [2020-11-30 00:45:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash 397934230, now seen corresponding path program 28 times [2020-11-30 00:45:03,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:03,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338477573] [2020-11-30 00:45:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:03,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:03,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:03,697 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:03,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:03,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 26 times [2020-11-30 00:45:03,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:03,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560454651] [2020-11-30 00:45:03,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:03,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:03,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:03,704 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1741798478, now seen corresponding path program 28 times [2020-11-30 00:45:03,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:03,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416607148] [2020-11-30 00:45:03,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 87 proven. 812 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:04,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416607148] [2020-11-30 00:45:04,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682192605] [2020-11-30 00:45:04,364 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:04,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 00:45:04,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:04,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 30 conjunts are in the unsatisfiable core [2020-11-30 00:45:04,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 87 proven. 812 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:04,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:04,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2020-11-30 00:45:04,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501340353] [2020-11-30 00:45:04,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:04,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-11-30 00:45:04,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2020-11-30 00:45:04,560 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. cyclomatic complexity: 3 Second operand 31 states. [2020-11-30 00:45:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:04,692 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-11-30 00:45:04,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-30 00:45:04,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 67 transitions. [2020-11-30 00:45:04,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:04,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 66 transitions. [2020-11-30 00:45:04,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:04,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:04,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 66 transitions. [2020-11-30 00:45:04,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:04,695 INFO L691 BuchiCegarLoop]: Abstraction has 64 states and 66 transitions. [2020-11-30 00:45:04,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 66 transitions. [2020-11-30 00:45:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2020-11-30 00:45:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-30 00:45:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2020-11-30 00:45:04,697 INFO L714 BuchiCegarLoop]: Abstraction has 63 states and 65 transitions. [2020-11-30 00:45:04,697 INFO L594 BuchiCegarLoop]: Abstraction has 63 states and 65 transitions. [2020-11-30 00:45:04,697 INFO L427 BuchiCegarLoop]: ======== Iteration 31============ [2020-11-30 00:45:04,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 65 transitions. [2020-11-30 00:45:04,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:04,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:04,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:04,699 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [30, 29, 1] [2020-11-30 00:45:04,699 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:04,699 INFO L794 eck$LassoCheckResult]: Stem: 5914#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 5910#L12-2 assume !!(main_~i~0 < main_~j~0); 5911#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5912#L12-2 assume !!(main_~i~0 < main_~j~0); 5913#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5917#L12-2 assume !!(main_~i~0 < main_~j~0); 5972#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5971#L12-2 assume !!(main_~i~0 < main_~j~0); 5970#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5969#L12-2 assume !!(main_~i~0 < main_~j~0); 5968#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5967#L12-2 assume !!(main_~i~0 < main_~j~0); 5966#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5965#L12-2 assume !!(main_~i~0 < main_~j~0); 5964#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5963#L12-2 assume !!(main_~i~0 < main_~j~0); 5962#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5961#L12-2 assume !!(main_~i~0 < main_~j~0); 5960#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5959#L12-2 assume !!(main_~i~0 < main_~j~0); 5958#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5957#L12-2 assume !!(main_~i~0 < main_~j~0); 5956#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5955#L12-2 assume !!(main_~i~0 < main_~j~0); 5954#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5953#L12-2 assume !!(main_~i~0 < main_~j~0); 5952#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5951#L12-2 assume !!(main_~i~0 < main_~j~0); 5950#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5949#L12-2 assume !!(main_~i~0 < main_~j~0); 5948#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5947#L12-2 assume !!(main_~i~0 < main_~j~0); 5946#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5945#L12-2 assume !!(main_~i~0 < main_~j~0); 5944#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5943#L12-2 assume !!(main_~i~0 < main_~j~0); 5942#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5941#L12-2 assume !!(main_~i~0 < main_~j~0); 5940#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5939#L12-2 assume !!(main_~i~0 < main_~j~0); 5938#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5937#L12-2 assume !!(main_~i~0 < main_~j~0); 5936#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5935#L12-2 assume !!(main_~i~0 < main_~j~0); 5934#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5933#L12-2 assume !!(main_~i~0 < main_~j~0); 5932#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5931#L12-2 assume !!(main_~i~0 < main_~j~0); 5930#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5929#L12-2 assume !!(main_~i~0 < main_~j~0); 5928#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5927#L12-2 assume !!(main_~i~0 < main_~j~0); 5926#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5925#L12-2 assume !!(main_~i~0 < main_~j~0); 5924#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5923#L12-2 assume !!(main_~i~0 < main_~j~0); 5921#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5920#L12-2 assume !!(main_~i~0 < main_~j~0); 5919#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5918#L12-2 assume !!(main_~i~0 < main_~j~0); 5915#L12 [2020-11-30 00:45:04,699 INFO L796 eck$LassoCheckResult]: Loop: 5915#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 5916#L12-2 assume !!(main_~i~0 < main_~j~0); 5919#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 5918#L12-2 assume !!(main_~i~0 < main_~j~0); 5915#L12 [2020-11-30 00:45:04,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:04,700 INFO L82 PathProgramCache]: Analyzing trace with hash 162706099, now seen corresponding path program 29 times [2020-11-30 00:45:04,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:04,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660021592] [2020-11-30 00:45:04,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:04,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:04,731 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:04,734 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:04,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 27 times [2020-11-30 00:45:04,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:04,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008056998] [2020-11-30 00:45:04,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:04,738 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:04,740 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:04,740 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:04,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:04,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1226106389, now seen corresponding path program 29 times [2020-11-30 00:45:04,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:04,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063500065] [2020-11-30 00:45:04,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 90 proven. 870 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:05,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063500065] [2020-11-30 00:45:05,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830898787] [2020-11-30 00:45:05,372 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:05,429 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2020-11-30 00:45:05,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:05,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 31 conjunts are in the unsatisfiable core [2020-11-30 00:45:05,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 90 proven. 870 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:05,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:05,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2020-11-30 00:45:05,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235003711] [2020-11-30 00:45:05,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:05,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-11-30 00:45:05,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2020-11-30 00:45:05,511 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. cyclomatic complexity: 3 Second operand 32 states. [2020-11-30 00:45:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:05,676 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2020-11-30 00:45:05,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-11-30 00:45:05,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 69 transitions. [2020-11-30 00:45:05,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:05,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 66 states and 68 transitions. [2020-11-30 00:45:05,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:05,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:05,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 68 transitions. [2020-11-30 00:45:05,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:05,679 INFO L691 BuchiCegarLoop]: Abstraction has 66 states and 68 transitions. [2020-11-30 00:45:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 68 transitions. [2020-11-30 00:45:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2020-11-30 00:45:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-30 00:45:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2020-11-30 00:45:05,681 INFO L714 BuchiCegarLoop]: Abstraction has 65 states and 67 transitions. [2020-11-30 00:45:05,681 INFO L594 BuchiCegarLoop]: Abstraction has 65 states and 67 transitions. [2020-11-30 00:45:05,681 INFO L427 BuchiCegarLoop]: ======== Iteration 32============ [2020-11-30 00:45:05,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 67 transitions. [2020-11-30 00:45:05,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:05,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:05,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:05,682 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [31, 30, 1] [2020-11-30 00:45:05,683 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:05,683 INFO L794 eck$LassoCheckResult]: Stem: 6270#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 6266#L12-2 assume !!(main_~i~0 < main_~j~0); 6267#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6268#L12-2 assume !!(main_~i~0 < main_~j~0); 6269#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6273#L12-2 assume !!(main_~i~0 < main_~j~0); 6330#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6329#L12-2 assume !!(main_~i~0 < main_~j~0); 6328#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6327#L12-2 assume !!(main_~i~0 < main_~j~0); 6326#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6325#L12-2 assume !!(main_~i~0 < main_~j~0); 6324#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6323#L12-2 assume !!(main_~i~0 < main_~j~0); 6322#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6321#L12-2 assume !!(main_~i~0 < main_~j~0); 6320#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6319#L12-2 assume !!(main_~i~0 < main_~j~0); 6318#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6317#L12-2 assume !!(main_~i~0 < main_~j~0); 6316#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6315#L12-2 assume !!(main_~i~0 < main_~j~0); 6314#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6313#L12-2 assume !!(main_~i~0 < main_~j~0); 6312#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6311#L12-2 assume !!(main_~i~0 < main_~j~0); 6310#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6309#L12-2 assume !!(main_~i~0 < main_~j~0); 6308#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6307#L12-2 assume !!(main_~i~0 < main_~j~0); 6306#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6305#L12-2 assume !!(main_~i~0 < main_~j~0); 6304#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6303#L12-2 assume !!(main_~i~0 < main_~j~0); 6302#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6301#L12-2 assume !!(main_~i~0 < main_~j~0); 6300#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6299#L12-2 assume !!(main_~i~0 < main_~j~0); 6298#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6297#L12-2 assume !!(main_~i~0 < main_~j~0); 6296#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6295#L12-2 assume !!(main_~i~0 < main_~j~0); 6294#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6293#L12-2 assume !!(main_~i~0 < main_~j~0); 6292#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6291#L12-2 assume !!(main_~i~0 < main_~j~0); 6290#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6289#L12-2 assume !!(main_~i~0 < main_~j~0); 6288#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6287#L12-2 assume !!(main_~i~0 < main_~j~0); 6286#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6285#L12-2 assume !!(main_~i~0 < main_~j~0); 6284#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6283#L12-2 assume !!(main_~i~0 < main_~j~0); 6282#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6281#L12-2 assume !!(main_~i~0 < main_~j~0); 6280#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6279#L12-2 assume !!(main_~i~0 < main_~j~0); 6277#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6276#L12-2 assume !!(main_~i~0 < main_~j~0); 6275#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6274#L12-2 assume !!(main_~i~0 < main_~j~0); 6271#L12 [2020-11-30 00:45:05,683 INFO L796 eck$LassoCheckResult]: Loop: 6271#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 6272#L12-2 assume !!(main_~i~0 < main_~j~0); 6275#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6274#L12-2 assume !!(main_~i~0 < main_~j~0); 6271#L12 [2020-11-30 00:45:05,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:05,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1741738896, now seen corresponding path program 30 times [2020-11-30 00:45:05,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:05,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426322183] [2020-11-30 00:45:05,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:05,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:05,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:05,719 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:05,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 28 times [2020-11-30 00:45:05,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:05,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630727753] [2020-11-30 00:45:05,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:05,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:05,725 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:05,726 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:05,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:05,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1524399032, now seen corresponding path program 30 times [2020-11-30 00:45:05,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:05,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035445791] [2020-11-30 00:45:05,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:06,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035445791] [2020-11-30 00:45:06,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625093484] [2020-11-30 00:45:06,577 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:06,636 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2020-11-30 00:45:06,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:06,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjunts are in the unsatisfiable core [2020-11-30 00:45:06,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:06,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:06,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2020-11-30 00:45:06,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622120602] [2020-11-30 00:45:06,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:06,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-11-30 00:45:06,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2020-11-30 00:45:06,762 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. cyclomatic complexity: 3 Second operand 33 states. [2020-11-30 00:45:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:06,931 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2020-11-30 00:45:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-30 00:45:06,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 71 transitions. [2020-11-30 00:45:06,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:06,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 68 states and 70 transitions. [2020-11-30 00:45:06,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:06,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:06,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 70 transitions. [2020-11-30 00:45:06,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:06,934 INFO L691 BuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2020-11-30 00:45:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 70 transitions. [2020-11-30 00:45:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2020-11-30 00:45:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-30 00:45:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2020-11-30 00:45:06,935 INFO L714 BuchiCegarLoop]: Abstraction has 67 states and 69 transitions. [2020-11-30 00:45:06,935 INFO L594 BuchiCegarLoop]: Abstraction has 67 states and 69 transitions. [2020-11-30 00:45:06,935 INFO L427 BuchiCegarLoop]: ======== Iteration 33============ [2020-11-30 00:45:06,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 69 transitions. [2020-11-30 00:45:06,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:06,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:06,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:06,937 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [32, 31, 1] [2020-11-30 00:45:06,937 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:06,937 INFO L794 eck$LassoCheckResult]: Stem: 6637#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 6633#L12-2 assume !!(main_~i~0 < main_~j~0); 6634#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6635#L12-2 assume !!(main_~i~0 < main_~j~0); 6636#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6640#L12-2 assume !!(main_~i~0 < main_~j~0); 6699#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6698#L12-2 assume !!(main_~i~0 < main_~j~0); 6697#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6696#L12-2 assume !!(main_~i~0 < main_~j~0); 6695#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6694#L12-2 assume !!(main_~i~0 < main_~j~0); 6693#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6692#L12-2 assume !!(main_~i~0 < main_~j~0); 6691#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6690#L12-2 assume !!(main_~i~0 < main_~j~0); 6689#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6688#L12-2 assume !!(main_~i~0 < main_~j~0); 6687#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6686#L12-2 assume !!(main_~i~0 < main_~j~0); 6685#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6684#L12-2 assume !!(main_~i~0 < main_~j~0); 6683#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6682#L12-2 assume !!(main_~i~0 < main_~j~0); 6681#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6680#L12-2 assume !!(main_~i~0 < main_~j~0); 6679#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6678#L12-2 assume !!(main_~i~0 < main_~j~0); 6677#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6676#L12-2 assume !!(main_~i~0 < main_~j~0); 6675#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6674#L12-2 assume !!(main_~i~0 < main_~j~0); 6673#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6672#L12-2 assume !!(main_~i~0 < main_~j~0); 6671#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6670#L12-2 assume !!(main_~i~0 < main_~j~0); 6669#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6668#L12-2 assume !!(main_~i~0 < main_~j~0); 6667#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6666#L12-2 assume !!(main_~i~0 < main_~j~0); 6665#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6664#L12-2 assume !!(main_~i~0 < main_~j~0); 6663#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6662#L12-2 assume !!(main_~i~0 < main_~j~0); 6661#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6660#L12-2 assume !!(main_~i~0 < main_~j~0); 6659#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6658#L12-2 assume !!(main_~i~0 < main_~j~0); 6657#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6656#L12-2 assume !!(main_~i~0 < main_~j~0); 6655#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6654#L12-2 assume !!(main_~i~0 < main_~j~0); 6653#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6652#L12-2 assume !!(main_~i~0 < main_~j~0); 6651#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6650#L12-2 assume !!(main_~i~0 < main_~j~0); 6649#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6648#L12-2 assume !!(main_~i~0 < main_~j~0); 6647#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6646#L12-2 assume !!(main_~i~0 < main_~j~0); 6644#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6643#L12-2 assume !!(main_~i~0 < main_~j~0); 6642#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6641#L12-2 assume !!(main_~i~0 < main_~j~0); 6638#L12 [2020-11-30 00:45:06,938 INFO L796 eck$LassoCheckResult]: Loop: 6638#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 6639#L12-2 assume !!(main_~i~0 < main_~j~0); 6642#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 6641#L12-2 assume !!(main_~i~0 < main_~j~0); 6638#L12 [2020-11-30 00:45:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:06,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1226165971, now seen corresponding path program 31 times [2020-11-30 00:45:06,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:06,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842829984] [2020-11-30 00:45:06,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:06,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:06,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:06,974 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:06,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:06,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 29 times [2020-11-30 00:45:06,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:06,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92585628] [2020-11-30 00:45:06,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:06,977 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:06,979 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:06,980 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:06,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:06,980 INFO L82 PathProgramCache]: Analyzing trace with hash -420820123, now seen corresponding path program 31 times [2020-11-30 00:45:06,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:06,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229703126] [2020-11-30 00:45:06,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 96 proven. 992 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:08,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229703126] [2020-11-30 00:45:08,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132298231] [2020-11-30 00:45:08,021 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:08,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 33 conjunts are in the unsatisfiable core [2020-11-30 00:45:08,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 96 proven. 992 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:08,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:08,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2020-11-30 00:45:08,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603417001] [2020-11-30 00:45:08,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:08,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-11-30 00:45:08,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2020-11-30 00:45:08,187 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. cyclomatic complexity: 3 Second operand 34 states. [2020-11-30 00:45:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:08,307 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2020-11-30 00:45:08,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-30 00:45:08,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 73 transitions. [2020-11-30 00:45:08,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:08,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 70 states and 72 transitions. [2020-11-30 00:45:08,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:08,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:08,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 72 transitions. [2020-11-30 00:45:08,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:08,310 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-11-30 00:45:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 72 transitions. [2020-11-30 00:45:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2020-11-30 00:45:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-30 00:45:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2020-11-30 00:45:08,311 INFO L714 BuchiCegarLoop]: Abstraction has 69 states and 71 transitions. [2020-11-30 00:45:08,311 INFO L594 BuchiCegarLoop]: Abstraction has 69 states and 71 transitions. [2020-11-30 00:45:08,311 INFO L427 BuchiCegarLoop]: ======== Iteration 34============ [2020-11-30 00:45:08,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 71 transitions. [2020-11-30 00:45:08,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:08,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:08,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:08,313 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [33, 32, 1] [2020-11-30 00:45:08,313 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:08,313 INFO L794 eck$LassoCheckResult]: Stem: 7015#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 7011#L12-2 assume !!(main_~i~0 < main_~j~0); 7012#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7013#L12-2 assume !!(main_~i~0 < main_~j~0); 7014#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7018#L12-2 assume !!(main_~i~0 < main_~j~0); 7079#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7078#L12-2 assume !!(main_~i~0 < main_~j~0); 7077#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7076#L12-2 assume !!(main_~i~0 < main_~j~0); 7075#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7074#L12-2 assume !!(main_~i~0 < main_~j~0); 7073#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7072#L12-2 assume !!(main_~i~0 < main_~j~0); 7071#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7070#L12-2 assume !!(main_~i~0 < main_~j~0); 7069#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7068#L12-2 assume !!(main_~i~0 < main_~j~0); 7067#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7066#L12-2 assume !!(main_~i~0 < main_~j~0); 7065#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7064#L12-2 assume !!(main_~i~0 < main_~j~0); 7063#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7062#L12-2 assume !!(main_~i~0 < main_~j~0); 7061#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7060#L12-2 assume !!(main_~i~0 < main_~j~0); 7059#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7058#L12-2 assume !!(main_~i~0 < main_~j~0); 7057#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7056#L12-2 assume !!(main_~i~0 < main_~j~0); 7055#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7054#L12-2 assume !!(main_~i~0 < main_~j~0); 7053#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7052#L12-2 assume !!(main_~i~0 < main_~j~0); 7051#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7050#L12-2 assume !!(main_~i~0 < main_~j~0); 7049#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7048#L12-2 assume !!(main_~i~0 < main_~j~0); 7047#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7046#L12-2 assume !!(main_~i~0 < main_~j~0); 7045#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7044#L12-2 assume !!(main_~i~0 < main_~j~0); 7043#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7042#L12-2 assume !!(main_~i~0 < main_~j~0); 7041#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7040#L12-2 assume !!(main_~i~0 < main_~j~0); 7039#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7038#L12-2 assume !!(main_~i~0 < main_~j~0); 7037#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7036#L12-2 assume !!(main_~i~0 < main_~j~0); 7035#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7034#L12-2 assume !!(main_~i~0 < main_~j~0); 7033#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7032#L12-2 assume !!(main_~i~0 < main_~j~0); 7031#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7030#L12-2 assume !!(main_~i~0 < main_~j~0); 7029#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7028#L12-2 assume !!(main_~i~0 < main_~j~0); 7027#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7026#L12-2 assume !!(main_~i~0 < main_~j~0); 7025#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7024#L12-2 assume !!(main_~i~0 < main_~j~0); 7022#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7021#L12-2 assume !!(main_~i~0 < main_~j~0); 7020#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7019#L12-2 assume !!(main_~i~0 < main_~j~0); 7016#L12 [2020-11-30 00:45:08,313 INFO L796 eck$LassoCheckResult]: Loop: 7016#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 7017#L12-2 assume !!(main_~i~0 < main_~j~0); 7020#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7019#L12-2 assume !!(main_~i~0 < main_~j~0); 7016#L12 [2020-11-30 00:45:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:08,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1524458614, now seen corresponding path program 32 times [2020-11-30 00:45:08,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:08,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68964188] [2020-11-30 00:45:08,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:08,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:08,349 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:08,352 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:08,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:08,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 30 times [2020-11-30 00:45:08,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:08,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170099759] [2020-11-30 00:45:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:08,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:08,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:08,358 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:08,359 INFO L82 PathProgramCache]: Analyzing trace with hash -738410686, now seen corresponding path program 32 times [2020-11-30 00:45:08,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:08,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559086280] [2020-11-30 00:45:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 99 proven. 1056 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:09,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559086280] [2020-11-30 00:45:09,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896853551] [2020-11-30 00:45:09,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:09,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:45:09,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:09,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 34 conjunts are in the unsatisfiable core [2020-11-30 00:45:09,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 99 proven. 1056 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:09,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:09,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2020-11-30 00:45:09,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914081054] [2020-11-30 00:45:09,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:09,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-11-30 00:45:09,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2020-11-30 00:45:09,724 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. cyclomatic complexity: 3 Second operand 35 states. [2020-11-30 00:45:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:09,831 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-11-30 00:45:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-30 00:45:09,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 75 transitions. [2020-11-30 00:45:09,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:09,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 74 transitions. [2020-11-30 00:45:09,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:09,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:09,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 74 transitions. [2020-11-30 00:45:09,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:09,833 INFO L691 BuchiCegarLoop]: Abstraction has 72 states and 74 transitions. [2020-11-30 00:45:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 74 transitions. [2020-11-30 00:45:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-11-30 00:45:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-30 00:45:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2020-11-30 00:45:09,835 INFO L714 BuchiCegarLoop]: Abstraction has 71 states and 73 transitions. [2020-11-30 00:45:09,835 INFO L594 BuchiCegarLoop]: Abstraction has 71 states and 73 transitions. [2020-11-30 00:45:09,835 INFO L427 BuchiCegarLoop]: ======== Iteration 35============ [2020-11-30 00:45:09,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 73 transitions. [2020-11-30 00:45:09,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:09,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:09,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:09,836 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [34, 33, 1] [2020-11-30 00:45:09,836 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:09,837 INFO L794 eck$LassoCheckResult]: Stem: 7404#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 7400#L12-2 assume !!(main_~i~0 < main_~j~0); 7401#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7402#L12-2 assume !!(main_~i~0 < main_~j~0); 7403#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7407#L12-2 assume !!(main_~i~0 < main_~j~0); 7470#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7469#L12-2 assume !!(main_~i~0 < main_~j~0); 7468#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7467#L12-2 assume !!(main_~i~0 < main_~j~0); 7466#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7465#L12-2 assume !!(main_~i~0 < main_~j~0); 7464#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7463#L12-2 assume !!(main_~i~0 < main_~j~0); 7462#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7461#L12-2 assume !!(main_~i~0 < main_~j~0); 7460#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7459#L12-2 assume !!(main_~i~0 < main_~j~0); 7458#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7457#L12-2 assume !!(main_~i~0 < main_~j~0); 7456#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7455#L12-2 assume !!(main_~i~0 < main_~j~0); 7454#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7453#L12-2 assume !!(main_~i~0 < main_~j~0); 7452#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7451#L12-2 assume !!(main_~i~0 < main_~j~0); 7450#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7449#L12-2 assume !!(main_~i~0 < main_~j~0); 7448#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7447#L12-2 assume !!(main_~i~0 < main_~j~0); 7446#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7445#L12-2 assume !!(main_~i~0 < main_~j~0); 7444#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7443#L12-2 assume !!(main_~i~0 < main_~j~0); 7442#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7441#L12-2 assume !!(main_~i~0 < main_~j~0); 7440#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7439#L12-2 assume !!(main_~i~0 < main_~j~0); 7438#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7437#L12-2 assume !!(main_~i~0 < main_~j~0); 7436#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7435#L12-2 assume !!(main_~i~0 < main_~j~0); 7434#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7433#L12-2 assume !!(main_~i~0 < main_~j~0); 7432#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7431#L12-2 assume !!(main_~i~0 < main_~j~0); 7430#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7429#L12-2 assume !!(main_~i~0 < main_~j~0); 7428#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7427#L12-2 assume !!(main_~i~0 < main_~j~0); 7426#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7425#L12-2 assume !!(main_~i~0 < main_~j~0); 7424#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7423#L12-2 assume !!(main_~i~0 < main_~j~0); 7422#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7421#L12-2 assume !!(main_~i~0 < main_~j~0); 7420#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7419#L12-2 assume !!(main_~i~0 < main_~j~0); 7418#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7417#L12-2 assume !!(main_~i~0 < main_~j~0); 7416#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7415#L12-2 assume !!(main_~i~0 < main_~j~0); 7414#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7413#L12-2 assume !!(main_~i~0 < main_~j~0); 7411#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7410#L12-2 assume !!(main_~i~0 < main_~j~0); 7409#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7408#L12-2 assume !!(main_~i~0 < main_~j~0); 7405#L12 [2020-11-30 00:45:09,837 INFO L796 eck$LassoCheckResult]: Loop: 7405#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 7406#L12-2 assume !!(main_~i~0 < main_~j~0); 7409#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7408#L12-2 assume !!(main_~i~0 < main_~j~0); 7405#L12 [2020-11-30 00:45:09,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:09,837 INFO L82 PathProgramCache]: Analyzing trace with hash -420879705, now seen corresponding path program 33 times [2020-11-30 00:45:09,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:09,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556200988] [2020-11-30 00:45:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:09,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:09,869 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:09,873 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:09,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:09,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 31 times [2020-11-30 00:45:09,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:09,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174695313] [2020-11-30 00:45:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:09,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:09,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:09,879 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:09,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:09,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1000263713, now seen corresponding path program 33 times [2020-11-30 00:45:09,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:09,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108153744] [2020-11-30 00:45:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 102 proven. 1122 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:10,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108153744] [2020-11-30 00:45:10,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713682605] [2020-11-30 00:45:10,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:11,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2020-11-30 00:45:11,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:11,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 35 conjunts are in the unsatisfiable core [2020-11-30 00:45:11,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 102 proven. 1122 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:11,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:11,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2020-11-30 00:45:11,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783042186] [2020-11-30 00:45:11,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:11,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-11-30 00:45:11,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2020-11-30 00:45:11,105 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. cyclomatic complexity: 3 Second operand 36 states. [2020-11-30 00:45:11,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:11,235 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-11-30 00:45:11,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-30 00:45:11,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 77 transitions. [2020-11-30 00:45:11,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:11,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 74 states and 76 transitions. [2020-11-30 00:45:11,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:11,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:11,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 76 transitions. [2020-11-30 00:45:11,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:11,238 INFO L691 BuchiCegarLoop]: Abstraction has 74 states and 76 transitions. [2020-11-30 00:45:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 76 transitions. [2020-11-30 00:45:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2020-11-30 00:45:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-30 00:45:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2020-11-30 00:45:11,240 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 75 transitions. [2020-11-30 00:45:11,240 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 75 transitions. [2020-11-30 00:45:11,240 INFO L427 BuchiCegarLoop]: ======== Iteration 36============ [2020-11-30 00:45:11,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 75 transitions. [2020-11-30 00:45:11,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:11,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:11,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:11,242 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [35, 34, 1] [2020-11-30 00:45:11,242 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:11,242 INFO L794 eck$LassoCheckResult]: Stem: 7804#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 7800#L12-2 assume !!(main_~i~0 < main_~j~0); 7801#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7802#L12-2 assume !!(main_~i~0 < main_~j~0); 7803#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7807#L12-2 assume !!(main_~i~0 < main_~j~0); 7872#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7871#L12-2 assume !!(main_~i~0 < main_~j~0); 7870#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7869#L12-2 assume !!(main_~i~0 < main_~j~0); 7868#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7867#L12-2 assume !!(main_~i~0 < main_~j~0); 7866#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7865#L12-2 assume !!(main_~i~0 < main_~j~0); 7864#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7863#L12-2 assume !!(main_~i~0 < main_~j~0); 7862#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7861#L12-2 assume !!(main_~i~0 < main_~j~0); 7860#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7859#L12-2 assume !!(main_~i~0 < main_~j~0); 7858#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7857#L12-2 assume !!(main_~i~0 < main_~j~0); 7856#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7855#L12-2 assume !!(main_~i~0 < main_~j~0); 7854#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7853#L12-2 assume !!(main_~i~0 < main_~j~0); 7852#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7851#L12-2 assume !!(main_~i~0 < main_~j~0); 7850#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7849#L12-2 assume !!(main_~i~0 < main_~j~0); 7848#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7847#L12-2 assume !!(main_~i~0 < main_~j~0); 7846#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7845#L12-2 assume !!(main_~i~0 < main_~j~0); 7844#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7843#L12-2 assume !!(main_~i~0 < main_~j~0); 7842#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7841#L12-2 assume !!(main_~i~0 < main_~j~0); 7840#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7839#L12-2 assume !!(main_~i~0 < main_~j~0); 7838#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7837#L12-2 assume !!(main_~i~0 < main_~j~0); 7836#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7835#L12-2 assume !!(main_~i~0 < main_~j~0); 7834#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7833#L12-2 assume !!(main_~i~0 < main_~j~0); 7832#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7831#L12-2 assume !!(main_~i~0 < main_~j~0); 7830#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7829#L12-2 assume !!(main_~i~0 < main_~j~0); 7828#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7827#L12-2 assume !!(main_~i~0 < main_~j~0); 7826#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7825#L12-2 assume !!(main_~i~0 < main_~j~0); 7824#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7823#L12-2 assume !!(main_~i~0 < main_~j~0); 7822#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7821#L12-2 assume !!(main_~i~0 < main_~j~0); 7820#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7819#L12-2 assume !!(main_~i~0 < main_~j~0); 7818#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7817#L12-2 assume !!(main_~i~0 < main_~j~0); 7816#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7815#L12-2 assume !!(main_~i~0 < main_~j~0); 7814#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7813#L12-2 assume !!(main_~i~0 < main_~j~0); 7811#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7810#L12-2 assume !!(main_~i~0 < main_~j~0); 7809#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7808#L12-2 assume !!(main_~i~0 < main_~j~0); 7805#L12 [2020-11-30 00:45:11,243 INFO L796 eck$LassoCheckResult]: Loop: 7805#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 7806#L12-2 assume !!(main_~i~0 < main_~j~0); 7809#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 7808#L12-2 assume !!(main_~i~0 < main_~j~0); 7805#L12 [2020-11-30 00:45:11,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:11,243 INFO L82 PathProgramCache]: Analyzing trace with hash -738470268, now seen corresponding path program 34 times [2020-11-30 00:45:11,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:11,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134566073] [2020-11-30 00:45:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:11,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:11,281 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:11,284 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:11,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:11,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 32 times [2020-11-30 00:45:11,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:11,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218446256] [2020-11-30 00:45:11,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:11,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:11,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:11,290 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:11,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:11,291 INFO L82 PathProgramCache]: Analyzing trace with hash 762047804, now seen corresponding path program 34 times [2020-11-30 00:45:11,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:11,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915543806] [2020-11-30 00:45:11,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 105 proven. 1190 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:12,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915543806] [2020-11-30 00:45:12,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097871775] [2020-11-30 00:45:12,358 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:12,419 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 00:45:12,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:12,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 36 conjunts are in the unsatisfiable core [2020-11-30 00:45:12,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 105 proven. 1190 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:12,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:12,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2020-11-30 00:45:12,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608650946] [2020-11-30 00:45:12,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:12,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-11-30 00:45:12,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2020-11-30 00:45:12,530 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. cyclomatic complexity: 3 Second operand 37 states. [2020-11-30 00:45:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:12,686 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2020-11-30 00:45:12,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-11-30 00:45:12,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 79 transitions. [2020-11-30 00:45:12,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:12,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 76 states and 78 transitions. [2020-11-30 00:45:12,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:12,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:12,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 78 transitions. [2020-11-30 00:45:12,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:12,691 INFO L691 BuchiCegarLoop]: Abstraction has 76 states and 78 transitions. [2020-11-30 00:45:12,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 78 transitions. [2020-11-30 00:45:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2020-11-30 00:45:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-30 00:45:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2020-11-30 00:45:12,693 INFO L714 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2020-11-30 00:45:12,694 INFO L594 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2020-11-30 00:45:12,694 INFO L427 BuchiCegarLoop]: ======== Iteration 37============ [2020-11-30 00:45:12,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 77 transitions. [2020-11-30 00:45:12,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:12,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:12,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:12,695 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [36, 35, 1] [2020-11-30 00:45:12,695 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:12,696 INFO L794 eck$LassoCheckResult]: Stem: 8215#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 8211#L12-2 assume !!(main_~i~0 < main_~j~0); 8212#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8213#L12-2 assume !!(main_~i~0 < main_~j~0); 8214#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8218#L12-2 assume !!(main_~i~0 < main_~j~0); 8285#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8284#L12-2 assume !!(main_~i~0 < main_~j~0); 8283#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8282#L12-2 assume !!(main_~i~0 < main_~j~0); 8281#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8280#L12-2 assume !!(main_~i~0 < main_~j~0); 8279#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8278#L12-2 assume !!(main_~i~0 < main_~j~0); 8277#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8276#L12-2 assume !!(main_~i~0 < main_~j~0); 8275#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8274#L12-2 assume !!(main_~i~0 < main_~j~0); 8273#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8272#L12-2 assume !!(main_~i~0 < main_~j~0); 8271#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8270#L12-2 assume !!(main_~i~0 < main_~j~0); 8269#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8268#L12-2 assume !!(main_~i~0 < main_~j~0); 8267#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8266#L12-2 assume !!(main_~i~0 < main_~j~0); 8265#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8264#L12-2 assume !!(main_~i~0 < main_~j~0); 8263#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8262#L12-2 assume !!(main_~i~0 < main_~j~0); 8261#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8260#L12-2 assume !!(main_~i~0 < main_~j~0); 8259#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8258#L12-2 assume !!(main_~i~0 < main_~j~0); 8257#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8256#L12-2 assume !!(main_~i~0 < main_~j~0); 8255#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8254#L12-2 assume !!(main_~i~0 < main_~j~0); 8253#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8252#L12-2 assume !!(main_~i~0 < main_~j~0); 8251#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8250#L12-2 assume !!(main_~i~0 < main_~j~0); 8249#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8248#L12-2 assume !!(main_~i~0 < main_~j~0); 8247#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8246#L12-2 assume !!(main_~i~0 < main_~j~0); 8245#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8244#L12-2 assume !!(main_~i~0 < main_~j~0); 8243#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8242#L12-2 assume !!(main_~i~0 < main_~j~0); 8241#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8240#L12-2 assume !!(main_~i~0 < main_~j~0); 8239#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8238#L12-2 assume !!(main_~i~0 < main_~j~0); 8237#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8236#L12-2 assume !!(main_~i~0 < main_~j~0); 8235#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8234#L12-2 assume !!(main_~i~0 < main_~j~0); 8233#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8232#L12-2 assume !!(main_~i~0 < main_~j~0); 8231#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8230#L12-2 assume !!(main_~i~0 < main_~j~0); 8229#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8228#L12-2 assume !!(main_~i~0 < main_~j~0); 8227#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8226#L12-2 assume !!(main_~i~0 < main_~j~0); 8225#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8224#L12-2 assume !!(main_~i~0 < main_~j~0); 8222#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8221#L12-2 assume !!(main_~i~0 < main_~j~0); 8220#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8219#L12-2 assume !!(main_~i~0 < main_~j~0); 8216#L12 [2020-11-30 00:45:12,696 INFO L796 eck$LassoCheckResult]: Loop: 8216#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 8217#L12-2 assume !!(main_~i~0 < main_~j~0); 8220#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8219#L12-2 assume !!(main_~i~0 < main_~j~0); 8216#L12 [2020-11-30 00:45:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1000323295, now seen corresponding path program 35 times [2020-11-30 00:45:12,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:12,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844510094] [2020-11-30 00:45:12,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:12,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:12,736 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:12,739 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:12,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 33 times [2020-11-30 00:45:12,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:12,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303088074] [2020-11-30 00:45:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:12,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:12,745 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:12,746 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:12,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:12,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2126301017, now seen corresponding path program 35 times [2020-11-30 00:45:12,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:12,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152415334] [2020-11-30 00:45:12,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 108 proven. 1260 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:14,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152415334] [2020-11-30 00:45:14,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472591246] [2020-11-30 00:45:14,079 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:14,134 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2020-11-30 00:45:14,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:14,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2020-11-30 00:45:14,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 108 proven. 1260 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:14,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:14,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2020-11-30 00:45:14,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245030662] [2020-11-30 00:45:14,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:14,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-11-30 00:45:14,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2020-11-30 00:45:14,220 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. cyclomatic complexity: 3 Second operand 38 states. [2020-11-30 00:45:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:14,379 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2020-11-30 00:45:14,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-30 00:45:14,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 81 transitions. [2020-11-30 00:45:14,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:14,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 78 states and 80 transitions. [2020-11-30 00:45:14,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:14,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:14,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 80 transitions. [2020-11-30 00:45:14,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:14,381 INFO L691 BuchiCegarLoop]: Abstraction has 78 states and 80 transitions. [2020-11-30 00:45:14,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 80 transitions. [2020-11-30 00:45:14,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2020-11-30 00:45:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-30 00:45:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2020-11-30 00:45:14,383 INFO L714 BuchiCegarLoop]: Abstraction has 77 states and 79 transitions. [2020-11-30 00:45:14,383 INFO L594 BuchiCegarLoop]: Abstraction has 77 states and 79 transitions. [2020-11-30 00:45:14,383 INFO L427 BuchiCegarLoop]: ======== Iteration 38============ [2020-11-30 00:45:14,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 79 transitions. [2020-11-30 00:45:14,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:14,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:14,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:14,384 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [37, 36, 1] [2020-11-30 00:45:14,384 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:14,385 INFO L794 eck$LassoCheckResult]: Stem: 8637#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 8633#L12-2 assume !!(main_~i~0 < main_~j~0); 8634#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8635#L12-2 assume !!(main_~i~0 < main_~j~0); 8636#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8640#L12-2 assume !!(main_~i~0 < main_~j~0); 8709#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8708#L12-2 assume !!(main_~i~0 < main_~j~0); 8707#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8706#L12-2 assume !!(main_~i~0 < main_~j~0); 8705#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8704#L12-2 assume !!(main_~i~0 < main_~j~0); 8703#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8702#L12-2 assume !!(main_~i~0 < main_~j~0); 8701#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8700#L12-2 assume !!(main_~i~0 < main_~j~0); 8699#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8698#L12-2 assume !!(main_~i~0 < main_~j~0); 8697#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8696#L12-2 assume !!(main_~i~0 < main_~j~0); 8695#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8694#L12-2 assume !!(main_~i~0 < main_~j~0); 8693#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8692#L12-2 assume !!(main_~i~0 < main_~j~0); 8691#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8690#L12-2 assume !!(main_~i~0 < main_~j~0); 8689#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8688#L12-2 assume !!(main_~i~0 < main_~j~0); 8687#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8686#L12-2 assume !!(main_~i~0 < main_~j~0); 8685#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8684#L12-2 assume !!(main_~i~0 < main_~j~0); 8683#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8682#L12-2 assume !!(main_~i~0 < main_~j~0); 8681#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8680#L12-2 assume !!(main_~i~0 < main_~j~0); 8679#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8678#L12-2 assume !!(main_~i~0 < main_~j~0); 8677#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8676#L12-2 assume !!(main_~i~0 < main_~j~0); 8675#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8674#L12-2 assume !!(main_~i~0 < main_~j~0); 8673#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8672#L12-2 assume !!(main_~i~0 < main_~j~0); 8671#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8670#L12-2 assume !!(main_~i~0 < main_~j~0); 8669#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8668#L12-2 assume !!(main_~i~0 < main_~j~0); 8667#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8666#L12-2 assume !!(main_~i~0 < main_~j~0); 8665#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8664#L12-2 assume !!(main_~i~0 < main_~j~0); 8663#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8662#L12-2 assume !!(main_~i~0 < main_~j~0); 8661#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8660#L12-2 assume !!(main_~i~0 < main_~j~0); 8659#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8658#L12-2 assume !!(main_~i~0 < main_~j~0); 8657#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8656#L12-2 assume !!(main_~i~0 < main_~j~0); 8655#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8654#L12-2 assume !!(main_~i~0 < main_~j~0); 8653#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8652#L12-2 assume !!(main_~i~0 < main_~j~0); 8651#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8650#L12-2 assume !!(main_~i~0 < main_~j~0); 8649#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8648#L12-2 assume !!(main_~i~0 < main_~j~0); 8647#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8646#L12-2 assume !!(main_~i~0 < main_~j~0); 8644#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8643#L12-2 assume !!(main_~i~0 < main_~j~0); 8642#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8641#L12-2 assume !!(main_~i~0 < main_~j~0); 8638#L12 [2020-11-30 00:45:14,385 INFO L796 eck$LassoCheckResult]: Loop: 8638#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 8639#L12-2 assume !!(main_~i~0 < main_~j~0); 8642#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 8641#L12-2 assume !!(main_~i~0 < main_~j~0); 8638#L12 [2020-11-30 00:45:14,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:14,385 INFO L82 PathProgramCache]: Analyzing trace with hash 761988222, now seen corresponding path program 36 times [2020-11-30 00:45:14,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:14,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044647977] [2020-11-30 00:45:14,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:14,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:14,423 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:14,426 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:14,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:14,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 34 times [2020-11-30 00:45:14,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:14,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885954780] [2020-11-30 00:45:14,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:14,430 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:14,431 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:14,432 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:14,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1086353866, now seen corresponding path program 36 times [2020-11-30 00:45:14,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:14,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146733252] [2020-11-30 00:45:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1332 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:15,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146733252] [2020-11-30 00:45:15,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237104548] [2020-11-30 00:45:15,707 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:15,804 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2020-11-30 00:45:15,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:15,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 38 conjunts are in the unsatisfiable core [2020-11-30 00:45:15,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1332 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:15,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:15,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2020-11-30 00:45:15,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600214869] [2020-11-30 00:45:15,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:15,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-11-30 00:45:15,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2020-11-30 00:45:15,935 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. cyclomatic complexity: 3 Second operand 39 states. [2020-11-30 00:45:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:16,135 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2020-11-30 00:45:16,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-11-30 00:45:16,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 83 transitions. [2020-11-30 00:45:16,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:16,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 82 transitions. [2020-11-30 00:45:16,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:16,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:16,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 82 transitions. [2020-11-30 00:45:16,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:16,137 INFO L691 BuchiCegarLoop]: Abstraction has 80 states and 82 transitions. [2020-11-30 00:45:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 82 transitions. [2020-11-30 00:45:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2020-11-30 00:45:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-30 00:45:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2020-11-30 00:45:16,139 INFO L714 BuchiCegarLoop]: Abstraction has 79 states and 81 transitions. [2020-11-30 00:45:16,139 INFO L594 BuchiCegarLoop]: Abstraction has 79 states and 81 transitions. [2020-11-30 00:45:16,139 INFO L427 BuchiCegarLoop]: ======== Iteration 39============ [2020-11-30 00:45:16,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 81 transitions. [2020-11-30 00:45:16,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:16,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:16,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:16,140 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [38, 37, 1] [2020-11-30 00:45:16,140 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:16,141 INFO L794 eck$LassoCheckResult]: Stem: 9070#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 9066#L12-2 assume !!(main_~i~0 < main_~j~0); 9067#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9068#L12-2 assume !!(main_~i~0 < main_~j~0); 9069#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9073#L12-2 assume !!(main_~i~0 < main_~j~0); 9144#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9143#L12-2 assume !!(main_~i~0 < main_~j~0); 9142#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9141#L12-2 assume !!(main_~i~0 < main_~j~0); 9140#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9139#L12-2 assume !!(main_~i~0 < main_~j~0); 9138#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9137#L12-2 assume !!(main_~i~0 < main_~j~0); 9136#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9135#L12-2 assume !!(main_~i~0 < main_~j~0); 9134#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9133#L12-2 assume !!(main_~i~0 < main_~j~0); 9132#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9131#L12-2 assume !!(main_~i~0 < main_~j~0); 9130#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9129#L12-2 assume !!(main_~i~0 < main_~j~0); 9128#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9127#L12-2 assume !!(main_~i~0 < main_~j~0); 9126#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9125#L12-2 assume !!(main_~i~0 < main_~j~0); 9124#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9123#L12-2 assume !!(main_~i~0 < main_~j~0); 9122#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9121#L12-2 assume !!(main_~i~0 < main_~j~0); 9120#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9119#L12-2 assume !!(main_~i~0 < main_~j~0); 9118#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9117#L12-2 assume !!(main_~i~0 < main_~j~0); 9116#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9115#L12-2 assume !!(main_~i~0 < main_~j~0); 9114#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9113#L12-2 assume !!(main_~i~0 < main_~j~0); 9112#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9111#L12-2 assume !!(main_~i~0 < main_~j~0); 9110#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9109#L12-2 assume !!(main_~i~0 < main_~j~0); 9108#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9107#L12-2 assume !!(main_~i~0 < main_~j~0); 9106#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9105#L12-2 assume !!(main_~i~0 < main_~j~0); 9104#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9103#L12-2 assume !!(main_~i~0 < main_~j~0); 9102#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9101#L12-2 assume !!(main_~i~0 < main_~j~0); 9100#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9099#L12-2 assume !!(main_~i~0 < main_~j~0); 9098#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9097#L12-2 assume !!(main_~i~0 < main_~j~0); 9096#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9095#L12-2 assume !!(main_~i~0 < main_~j~0); 9094#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9093#L12-2 assume !!(main_~i~0 < main_~j~0); 9092#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9091#L12-2 assume !!(main_~i~0 < main_~j~0); 9090#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9089#L12-2 assume !!(main_~i~0 < main_~j~0); 9088#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9087#L12-2 assume !!(main_~i~0 < main_~j~0); 9086#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9085#L12-2 assume !!(main_~i~0 < main_~j~0); 9084#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9083#L12-2 assume !!(main_~i~0 < main_~j~0); 9082#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9081#L12-2 assume !!(main_~i~0 < main_~j~0); 9080#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9079#L12-2 assume !!(main_~i~0 < main_~j~0); 9077#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9076#L12-2 assume !!(main_~i~0 < main_~j~0); 9075#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9074#L12-2 assume !!(main_~i~0 < main_~j~0); 9071#L12 [2020-11-30 00:45:16,141 INFO L796 eck$LassoCheckResult]: Loop: 9071#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 9072#L12-2 assume !!(main_~i~0 < main_~j~0); 9075#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9074#L12-2 assume !!(main_~i~0 < main_~j~0); 9071#L12 [2020-11-30 00:45:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:16,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2126241435, now seen corresponding path program 37 times [2020-11-30 00:45:16,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:16,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399625477] [2020-11-30 00:45:16,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:16,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:16,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:16,185 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:16,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 35 times [2020-11-30 00:45:16,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:16,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984585301] [2020-11-30 00:45:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:16,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:16,190 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:16,190 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:16,191 INFO L82 PathProgramCache]: Analyzing trace with hash -366210605, now seen corresponding path program 37 times [2020-11-30 00:45:16,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:16,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784473576] [2020-11-30 00:45:16,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 114 proven. 1406 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:17,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784473576] [2020-11-30 00:45:17,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325888151] [2020-11-30 00:45:17,302 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:17,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 39 conjunts are in the unsatisfiable core [2020-11-30 00:45:17,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 114 proven. 1406 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:17,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:17,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2020-11-30 00:45:17,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279054364] [2020-11-30 00:45:17,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:17,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-11-30 00:45:17,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2020-11-30 00:45:17,448 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. cyclomatic complexity: 3 Second operand 40 states. [2020-11-30 00:45:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:17,601 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2020-11-30 00:45:17,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-11-30 00:45:17,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 85 transitions. [2020-11-30 00:45:17,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:17,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 82 states and 84 transitions. [2020-11-30 00:45:17,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:17,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:17,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 84 transitions. [2020-11-30 00:45:17,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:17,604 INFO L691 BuchiCegarLoop]: Abstraction has 82 states and 84 transitions. [2020-11-30 00:45:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 84 transitions. [2020-11-30 00:45:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2020-11-30 00:45:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-30 00:45:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2020-11-30 00:45:17,606 INFO L714 BuchiCegarLoop]: Abstraction has 81 states and 83 transitions. [2020-11-30 00:45:17,607 INFO L594 BuchiCegarLoop]: Abstraction has 81 states and 83 transitions. [2020-11-30 00:45:17,607 INFO L427 BuchiCegarLoop]: ======== Iteration 40============ [2020-11-30 00:45:17,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 83 transitions. [2020-11-30 00:45:17,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:17,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:17,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:17,608 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [39, 38, 1] [2020-11-30 00:45:17,608 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:17,609 INFO L794 eck$LassoCheckResult]: Stem: 9514#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 9510#L12-2 assume !!(main_~i~0 < main_~j~0); 9511#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9512#L12-2 assume !!(main_~i~0 < main_~j~0); 9513#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9517#L12-2 assume !!(main_~i~0 < main_~j~0); 9590#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9589#L12-2 assume !!(main_~i~0 < main_~j~0); 9588#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9587#L12-2 assume !!(main_~i~0 < main_~j~0); 9586#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9585#L12-2 assume !!(main_~i~0 < main_~j~0); 9584#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9583#L12-2 assume !!(main_~i~0 < main_~j~0); 9582#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9581#L12-2 assume !!(main_~i~0 < main_~j~0); 9580#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9579#L12-2 assume !!(main_~i~0 < main_~j~0); 9578#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9577#L12-2 assume !!(main_~i~0 < main_~j~0); 9576#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9575#L12-2 assume !!(main_~i~0 < main_~j~0); 9574#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9573#L12-2 assume !!(main_~i~0 < main_~j~0); 9572#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9571#L12-2 assume !!(main_~i~0 < main_~j~0); 9570#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9569#L12-2 assume !!(main_~i~0 < main_~j~0); 9568#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9567#L12-2 assume !!(main_~i~0 < main_~j~0); 9566#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9565#L12-2 assume !!(main_~i~0 < main_~j~0); 9564#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9563#L12-2 assume !!(main_~i~0 < main_~j~0); 9562#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9561#L12-2 assume !!(main_~i~0 < main_~j~0); 9560#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9559#L12-2 assume !!(main_~i~0 < main_~j~0); 9558#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9557#L12-2 assume !!(main_~i~0 < main_~j~0); 9556#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9555#L12-2 assume !!(main_~i~0 < main_~j~0); 9554#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9553#L12-2 assume !!(main_~i~0 < main_~j~0); 9552#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9551#L12-2 assume !!(main_~i~0 < main_~j~0); 9550#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9549#L12-2 assume !!(main_~i~0 < main_~j~0); 9548#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9547#L12-2 assume !!(main_~i~0 < main_~j~0); 9546#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9545#L12-2 assume !!(main_~i~0 < main_~j~0); 9544#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9543#L12-2 assume !!(main_~i~0 < main_~j~0); 9542#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9541#L12-2 assume !!(main_~i~0 < main_~j~0); 9540#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9539#L12-2 assume !!(main_~i~0 < main_~j~0); 9538#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9537#L12-2 assume !!(main_~i~0 < main_~j~0); 9536#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9535#L12-2 assume !!(main_~i~0 < main_~j~0); 9534#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9533#L12-2 assume !!(main_~i~0 < main_~j~0); 9532#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9531#L12-2 assume !!(main_~i~0 < main_~j~0); 9530#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9529#L12-2 assume !!(main_~i~0 < main_~j~0); 9528#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9527#L12-2 assume !!(main_~i~0 < main_~j~0); 9526#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9525#L12-2 assume !!(main_~i~0 < main_~j~0); 9524#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9523#L12-2 assume !!(main_~i~0 < main_~j~0); 9521#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9520#L12-2 assume !!(main_~i~0 < main_~j~0); 9519#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9518#L12-2 assume !!(main_~i~0 < main_~j~0); 9515#L12 [2020-11-30 00:45:17,609 INFO L796 eck$LassoCheckResult]: Loop: 9515#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 9516#L12-2 assume !!(main_~i~0 < main_~j~0); 9519#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9518#L12-2 assume !!(main_~i~0 < main_~j~0); 9515#L12 [2020-11-30 00:45:17,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:17,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1086413448, now seen corresponding path program 38 times [2020-11-30 00:45:17,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:17,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101191195] [2020-11-30 00:45:17,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:17,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:17,652 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:17,656 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:17,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:17,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 36 times [2020-11-30 00:45:17,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:17,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249099238] [2020-11-30 00:45:17,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:17,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:17,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:17,662 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:17,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:17,662 INFO L82 PathProgramCache]: Analyzing trace with hash 201728560, now seen corresponding path program 38 times [2020-11-30 00:45:17,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:17,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005544933] [2020-11-30 00:45:17,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 117 proven. 1482 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:18,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005544933] [2020-11-30 00:45:18,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945500536] [2020-11-30 00:45:18,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:18,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:45:18,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:18,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 40 conjunts are in the unsatisfiable core [2020-11-30 00:45:18,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 117 proven. 1482 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:18,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:18,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2020-11-30 00:45:18,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661771075] [2020-11-30 00:45:19,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:19,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-30 00:45:19,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2020-11-30 00:45:19,041 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. cyclomatic complexity: 3 Second operand 41 states. [2020-11-30 00:45:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:19,274 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2020-11-30 00:45:19,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-11-30 00:45:19,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 87 transitions. [2020-11-30 00:45:19,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:19,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 84 states and 86 transitions. [2020-11-30 00:45:19,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:19,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:19,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 86 transitions. [2020-11-30 00:45:19,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:19,277 INFO L691 BuchiCegarLoop]: Abstraction has 84 states and 86 transitions. [2020-11-30 00:45:19,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 86 transitions. [2020-11-30 00:45:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2020-11-30 00:45:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-30 00:45:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2020-11-30 00:45:19,279 INFO L714 BuchiCegarLoop]: Abstraction has 83 states and 85 transitions. [2020-11-30 00:45:19,279 INFO L594 BuchiCegarLoop]: Abstraction has 83 states and 85 transitions. [2020-11-30 00:45:19,279 INFO L427 BuchiCegarLoop]: ======== Iteration 41============ [2020-11-30 00:45:19,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 85 transitions. [2020-11-30 00:45:19,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:19,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:19,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:19,281 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [40, 39, 1] [2020-11-30 00:45:19,281 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:19,281 INFO L794 eck$LassoCheckResult]: Stem: 9969#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 9965#L12-2 assume !!(main_~i~0 < main_~j~0); 9966#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9967#L12-2 assume !!(main_~i~0 < main_~j~0); 9968#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9972#L12-2 assume !!(main_~i~0 < main_~j~0); 10047#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10046#L12-2 assume !!(main_~i~0 < main_~j~0); 10045#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10044#L12-2 assume !!(main_~i~0 < main_~j~0); 10043#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10042#L12-2 assume !!(main_~i~0 < main_~j~0); 10041#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10040#L12-2 assume !!(main_~i~0 < main_~j~0); 10039#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10038#L12-2 assume !!(main_~i~0 < main_~j~0); 10037#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10036#L12-2 assume !!(main_~i~0 < main_~j~0); 10035#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10034#L12-2 assume !!(main_~i~0 < main_~j~0); 10033#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10032#L12-2 assume !!(main_~i~0 < main_~j~0); 10031#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10030#L12-2 assume !!(main_~i~0 < main_~j~0); 10029#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10028#L12-2 assume !!(main_~i~0 < main_~j~0); 10027#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10026#L12-2 assume !!(main_~i~0 < main_~j~0); 10025#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10024#L12-2 assume !!(main_~i~0 < main_~j~0); 10023#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10022#L12-2 assume !!(main_~i~0 < main_~j~0); 10021#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10020#L12-2 assume !!(main_~i~0 < main_~j~0); 10019#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10018#L12-2 assume !!(main_~i~0 < main_~j~0); 10017#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10016#L12-2 assume !!(main_~i~0 < main_~j~0); 10015#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10014#L12-2 assume !!(main_~i~0 < main_~j~0); 10013#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10012#L12-2 assume !!(main_~i~0 < main_~j~0); 10011#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10010#L12-2 assume !!(main_~i~0 < main_~j~0); 10009#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10008#L12-2 assume !!(main_~i~0 < main_~j~0); 10007#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10006#L12-2 assume !!(main_~i~0 < main_~j~0); 10005#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10004#L12-2 assume !!(main_~i~0 < main_~j~0); 10003#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10002#L12-2 assume !!(main_~i~0 < main_~j~0); 10001#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10000#L12-2 assume !!(main_~i~0 < main_~j~0); 9999#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9998#L12-2 assume !!(main_~i~0 < main_~j~0); 9997#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9996#L12-2 assume !!(main_~i~0 < main_~j~0); 9995#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9994#L12-2 assume !!(main_~i~0 < main_~j~0); 9993#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9992#L12-2 assume !!(main_~i~0 < main_~j~0); 9991#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9990#L12-2 assume !!(main_~i~0 < main_~j~0); 9989#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9988#L12-2 assume !!(main_~i~0 < main_~j~0); 9987#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9986#L12-2 assume !!(main_~i~0 < main_~j~0); 9985#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9984#L12-2 assume !!(main_~i~0 < main_~j~0); 9983#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9982#L12-2 assume !!(main_~i~0 < main_~j~0); 9981#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9980#L12-2 assume !!(main_~i~0 < main_~j~0); 9979#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9978#L12-2 assume !!(main_~i~0 < main_~j~0); 9976#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9975#L12-2 assume !!(main_~i~0 < main_~j~0); 9974#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9973#L12-2 assume !!(main_~i~0 < main_~j~0); 9970#L12 [2020-11-30 00:45:19,282 INFO L796 eck$LassoCheckResult]: Loop: 9970#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 9971#L12-2 assume !!(main_~i~0 < main_~j~0); 9974#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 9973#L12-2 assume !!(main_~i~0 < main_~j~0); 9970#L12 [2020-11-30 00:45:19,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash -366270187, now seen corresponding path program 39 times [2020-11-30 00:45:19,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:19,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604643197] [2020-11-30 00:45:19,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:19,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:19,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:19,341 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 37 times [2020-11-30 00:45:19,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:19,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355951360] [2020-11-30 00:45:19,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:19,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:19,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:19,348 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:19,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:19,349 INFO L82 PathProgramCache]: Analyzing trace with hash 530419533, now seen corresponding path program 39 times [2020-11-30 00:45:19,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:19,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119048953] [2020-11-30 00:45:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 120 proven. 1560 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:20,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119048953] [2020-11-30 00:45:20,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638361588] [2020-11-30 00:45:20,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:20,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2020-11-30 00:45:20,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:20,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 41 conjunts are in the unsatisfiable core [2020-11-30 00:45:20,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 120 proven. 1560 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:20,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:20,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2020-11-30 00:45:20,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565786245] [2020-11-30 00:45:20,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:20,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-11-30 00:45:20,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2020-11-30 00:45:20,641 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. cyclomatic complexity: 3 Second operand 42 states. [2020-11-30 00:45:20,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:20,809 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2020-11-30 00:45:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-11-30 00:45:20,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 89 transitions. [2020-11-30 00:45:20,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:20,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 86 states and 88 transitions. [2020-11-30 00:45:20,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:20,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:20,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 88 transitions. [2020-11-30 00:45:20,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:20,811 INFO L691 BuchiCegarLoop]: Abstraction has 86 states and 88 transitions. [2020-11-30 00:45:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 88 transitions. [2020-11-30 00:45:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2020-11-30 00:45:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-30 00:45:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2020-11-30 00:45:20,813 INFO L714 BuchiCegarLoop]: Abstraction has 85 states and 87 transitions. [2020-11-30 00:45:20,813 INFO L594 BuchiCegarLoop]: Abstraction has 85 states and 87 transitions. [2020-11-30 00:45:20,814 INFO L427 BuchiCegarLoop]: ======== Iteration 42============ [2020-11-30 00:45:20,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 87 transitions. [2020-11-30 00:45:20,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:20,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:20,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:20,816 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [41, 40, 1] [2020-11-30 00:45:20,816 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:20,816 INFO L794 eck$LassoCheckResult]: Stem: 10435#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 10431#L12-2 assume !!(main_~i~0 < main_~j~0); 10432#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10433#L12-2 assume !!(main_~i~0 < main_~j~0); 10434#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10438#L12-2 assume !!(main_~i~0 < main_~j~0); 10515#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10514#L12-2 assume !!(main_~i~0 < main_~j~0); 10513#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10512#L12-2 assume !!(main_~i~0 < main_~j~0); 10511#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10510#L12-2 assume !!(main_~i~0 < main_~j~0); 10509#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10508#L12-2 assume !!(main_~i~0 < main_~j~0); 10507#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10506#L12-2 assume !!(main_~i~0 < main_~j~0); 10505#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10504#L12-2 assume !!(main_~i~0 < main_~j~0); 10503#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10502#L12-2 assume !!(main_~i~0 < main_~j~0); 10501#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10500#L12-2 assume !!(main_~i~0 < main_~j~0); 10499#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10498#L12-2 assume !!(main_~i~0 < main_~j~0); 10497#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10496#L12-2 assume !!(main_~i~0 < main_~j~0); 10495#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10494#L12-2 assume !!(main_~i~0 < main_~j~0); 10493#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10492#L12-2 assume !!(main_~i~0 < main_~j~0); 10491#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10490#L12-2 assume !!(main_~i~0 < main_~j~0); 10489#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10488#L12-2 assume !!(main_~i~0 < main_~j~0); 10487#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10486#L12-2 assume !!(main_~i~0 < main_~j~0); 10485#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10484#L12-2 assume !!(main_~i~0 < main_~j~0); 10483#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10482#L12-2 assume !!(main_~i~0 < main_~j~0); 10481#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10480#L12-2 assume !!(main_~i~0 < main_~j~0); 10479#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10478#L12-2 assume !!(main_~i~0 < main_~j~0); 10477#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10476#L12-2 assume !!(main_~i~0 < main_~j~0); 10475#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10474#L12-2 assume !!(main_~i~0 < main_~j~0); 10473#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10472#L12-2 assume !!(main_~i~0 < main_~j~0); 10471#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10470#L12-2 assume !!(main_~i~0 < main_~j~0); 10469#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10468#L12-2 assume !!(main_~i~0 < main_~j~0); 10467#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10466#L12-2 assume !!(main_~i~0 < main_~j~0); 10465#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10464#L12-2 assume !!(main_~i~0 < main_~j~0); 10463#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10462#L12-2 assume !!(main_~i~0 < main_~j~0); 10461#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10460#L12-2 assume !!(main_~i~0 < main_~j~0); 10459#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10458#L12-2 assume !!(main_~i~0 < main_~j~0); 10457#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10456#L12-2 assume !!(main_~i~0 < main_~j~0); 10455#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10454#L12-2 assume !!(main_~i~0 < main_~j~0); 10453#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10452#L12-2 assume !!(main_~i~0 < main_~j~0); 10451#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10450#L12-2 assume !!(main_~i~0 < main_~j~0); 10449#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10448#L12-2 assume !!(main_~i~0 < main_~j~0); 10447#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10446#L12-2 assume !!(main_~i~0 < main_~j~0); 10445#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10444#L12-2 assume !!(main_~i~0 < main_~j~0); 10442#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10441#L12-2 assume !!(main_~i~0 < main_~j~0); 10440#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10439#L12-2 assume !!(main_~i~0 < main_~j~0); 10436#L12 [2020-11-30 00:45:20,816 INFO L796 eck$LassoCheckResult]: Loop: 10436#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 10437#L12-2 assume !!(main_~i~0 < main_~j~0); 10440#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10439#L12-2 assume !!(main_~i~0 < main_~j~0); 10436#L12 [2020-11-30 00:45:20,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:20,817 INFO L82 PathProgramCache]: Analyzing trace with hash 201668978, now seen corresponding path program 40 times [2020-11-30 00:45:20,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:20,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886767550] [2020-11-30 00:45:20,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:20,840 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:20,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:20,864 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:20,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:20,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 38 times [2020-11-30 00:45:20,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:20,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546056270] [2020-11-30 00:45:20,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:20,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:20,869 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:20,870 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:20,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:20,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1425135318, now seen corresponding path program 40 times [2020-11-30 00:45:20,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:20,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406975678] [2020-11-30 00:45:20,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 123 proven. 1640 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:22,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406975678] [2020-11-30 00:45:22,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717625006] [2020-11-30 00:45:22,007 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:22,058 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 00:45:22,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:22,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 42 conjunts are in the unsatisfiable core [2020-11-30 00:45:22,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 123 proven. 1640 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:22,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:22,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2020-11-30 00:45:22,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637174886] [2020-11-30 00:45:22,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:22,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-11-30 00:45:22,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2020-11-30 00:45:22,156 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. cyclomatic complexity: 3 Second operand 43 states. [2020-11-30 00:45:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:22,320 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2020-11-30 00:45:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-11-30 00:45:22,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 91 transitions. [2020-11-30 00:45:22,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:22,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 88 states and 90 transitions. [2020-11-30 00:45:22,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:22,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:22,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 90 transitions. [2020-11-30 00:45:22,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:22,323 INFO L691 BuchiCegarLoop]: Abstraction has 88 states and 90 transitions. [2020-11-30 00:45:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 90 transitions. [2020-11-30 00:45:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2020-11-30 00:45:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-30 00:45:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2020-11-30 00:45:22,324 INFO L714 BuchiCegarLoop]: Abstraction has 87 states and 89 transitions. [2020-11-30 00:45:22,324 INFO L594 BuchiCegarLoop]: Abstraction has 87 states and 89 transitions. [2020-11-30 00:45:22,324 INFO L427 BuchiCegarLoop]: ======== Iteration 43============ [2020-11-30 00:45:22,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 89 transitions. [2020-11-30 00:45:22,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:22,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:22,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:22,326 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [42, 41, 1] [2020-11-30 00:45:22,326 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:22,326 INFO L794 eck$LassoCheckResult]: Stem: 10912#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 10908#L12-2 assume !!(main_~i~0 < main_~j~0); 10909#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10910#L12-2 assume !!(main_~i~0 < main_~j~0); 10911#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10915#L12-2 assume !!(main_~i~0 < main_~j~0); 10994#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10993#L12-2 assume !!(main_~i~0 < main_~j~0); 10992#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10991#L12-2 assume !!(main_~i~0 < main_~j~0); 10990#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10989#L12-2 assume !!(main_~i~0 < main_~j~0); 10988#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10987#L12-2 assume !!(main_~i~0 < main_~j~0); 10986#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10985#L12-2 assume !!(main_~i~0 < main_~j~0); 10984#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10983#L12-2 assume !!(main_~i~0 < main_~j~0); 10982#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10981#L12-2 assume !!(main_~i~0 < main_~j~0); 10980#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10979#L12-2 assume !!(main_~i~0 < main_~j~0); 10978#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10977#L12-2 assume !!(main_~i~0 < main_~j~0); 10976#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10975#L12-2 assume !!(main_~i~0 < main_~j~0); 10974#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10973#L12-2 assume !!(main_~i~0 < main_~j~0); 10972#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10971#L12-2 assume !!(main_~i~0 < main_~j~0); 10970#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10969#L12-2 assume !!(main_~i~0 < main_~j~0); 10968#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10967#L12-2 assume !!(main_~i~0 < main_~j~0); 10966#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10965#L12-2 assume !!(main_~i~0 < main_~j~0); 10964#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10963#L12-2 assume !!(main_~i~0 < main_~j~0); 10962#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10961#L12-2 assume !!(main_~i~0 < main_~j~0); 10960#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10959#L12-2 assume !!(main_~i~0 < main_~j~0); 10958#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10957#L12-2 assume !!(main_~i~0 < main_~j~0); 10956#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10955#L12-2 assume !!(main_~i~0 < main_~j~0); 10954#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10953#L12-2 assume !!(main_~i~0 < main_~j~0); 10952#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10951#L12-2 assume !!(main_~i~0 < main_~j~0); 10950#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10949#L12-2 assume !!(main_~i~0 < main_~j~0); 10948#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10947#L12-2 assume !!(main_~i~0 < main_~j~0); 10946#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10945#L12-2 assume !!(main_~i~0 < main_~j~0); 10944#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10943#L12-2 assume !!(main_~i~0 < main_~j~0); 10942#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10941#L12-2 assume !!(main_~i~0 < main_~j~0); 10940#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10939#L12-2 assume !!(main_~i~0 < main_~j~0); 10938#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10937#L12-2 assume !!(main_~i~0 < main_~j~0); 10936#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10935#L12-2 assume !!(main_~i~0 < main_~j~0); 10934#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10933#L12-2 assume !!(main_~i~0 < main_~j~0); 10932#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10931#L12-2 assume !!(main_~i~0 < main_~j~0); 10930#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10929#L12-2 assume !!(main_~i~0 < main_~j~0); 10928#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10927#L12-2 assume !!(main_~i~0 < main_~j~0); 10926#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10925#L12-2 assume !!(main_~i~0 < main_~j~0); 10924#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10923#L12-2 assume !!(main_~i~0 < main_~j~0); 10922#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10921#L12-2 assume !!(main_~i~0 < main_~j~0); 10919#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10918#L12-2 assume !!(main_~i~0 < main_~j~0); 10917#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10916#L12-2 assume !!(main_~i~0 < main_~j~0); 10913#L12 [2020-11-30 00:45:22,326 INFO L796 eck$LassoCheckResult]: Loop: 10913#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 10914#L12-2 assume !!(main_~i~0 < main_~j~0); 10917#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 10916#L12-2 assume !!(main_~i~0 < main_~j~0); 10913#L12 [2020-11-30 00:45:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:22,326 INFO L82 PathProgramCache]: Analyzing trace with hash 530359951, now seen corresponding path program 41 times [2020-11-30 00:45:22,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:22,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056904590] [2020-11-30 00:45:22,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:22,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:22,369 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:22,373 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:22,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:22,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 39 times [2020-11-30 00:45:22,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:22,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344821301] [2020-11-30 00:45:22,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:22,377 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:22,378 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:22,379 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:22,380 INFO L82 PathProgramCache]: Analyzing trace with hash 482328519, now seen corresponding path program 41 times [2020-11-30 00:45:22,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:22,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387127476] [2020-11-30 00:45:22,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 126 proven. 1722 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:23,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387127476] [2020-11-30 00:45:23,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683868514] [2020-11-30 00:45:23,507 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:23,584 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2020-11-30 00:45:23,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:23,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 43 conjunts are in the unsatisfiable core [2020-11-30 00:45:23,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 126 proven. 1722 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:23,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:23,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2020-11-30 00:45:23,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321955862] [2020-11-30 00:45:23,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:23,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-11-30 00:45:23,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2020-11-30 00:45:23,698 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. cyclomatic complexity: 3 Second operand 44 states. [2020-11-30 00:45:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:23,930 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2020-11-30 00:45:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-11-30 00:45:23,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 93 transitions. [2020-11-30 00:45:23,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:23,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 90 states and 92 transitions. [2020-11-30 00:45:23,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:23,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:23,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 92 transitions. [2020-11-30 00:45:23,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:23,933 INFO L691 BuchiCegarLoop]: Abstraction has 90 states and 92 transitions. [2020-11-30 00:45:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 92 transitions. [2020-11-30 00:45:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2020-11-30 00:45:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-30 00:45:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2020-11-30 00:45:23,963 INFO L714 BuchiCegarLoop]: Abstraction has 89 states and 91 transitions. [2020-11-30 00:45:23,963 INFO L594 BuchiCegarLoop]: Abstraction has 89 states and 91 transitions. [2020-11-30 00:45:23,963 INFO L427 BuchiCegarLoop]: ======== Iteration 44============ [2020-11-30 00:45:23,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 91 transitions. [2020-11-30 00:45:23,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:23,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:23,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:23,964 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [43, 42, 1] [2020-11-30 00:45:23,964 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:23,965 INFO L794 eck$LassoCheckResult]: Stem: 11400#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 11396#L12-2 assume !!(main_~i~0 < main_~j~0); 11397#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11398#L12-2 assume !!(main_~i~0 < main_~j~0); 11399#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11403#L12-2 assume !!(main_~i~0 < main_~j~0); 11484#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11483#L12-2 assume !!(main_~i~0 < main_~j~0); 11482#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11481#L12-2 assume !!(main_~i~0 < main_~j~0); 11480#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11479#L12-2 assume !!(main_~i~0 < main_~j~0); 11478#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11477#L12-2 assume !!(main_~i~0 < main_~j~0); 11476#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11475#L12-2 assume !!(main_~i~0 < main_~j~0); 11474#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11473#L12-2 assume !!(main_~i~0 < main_~j~0); 11472#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11471#L12-2 assume !!(main_~i~0 < main_~j~0); 11470#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11469#L12-2 assume !!(main_~i~0 < main_~j~0); 11468#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11467#L12-2 assume !!(main_~i~0 < main_~j~0); 11466#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11465#L12-2 assume !!(main_~i~0 < main_~j~0); 11464#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11463#L12-2 assume !!(main_~i~0 < main_~j~0); 11462#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11461#L12-2 assume !!(main_~i~0 < main_~j~0); 11460#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11459#L12-2 assume !!(main_~i~0 < main_~j~0); 11458#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11457#L12-2 assume !!(main_~i~0 < main_~j~0); 11456#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11455#L12-2 assume !!(main_~i~0 < main_~j~0); 11454#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11453#L12-2 assume !!(main_~i~0 < main_~j~0); 11452#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11451#L12-2 assume !!(main_~i~0 < main_~j~0); 11450#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11449#L12-2 assume !!(main_~i~0 < main_~j~0); 11448#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11447#L12-2 assume !!(main_~i~0 < main_~j~0); 11446#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11445#L12-2 assume !!(main_~i~0 < main_~j~0); 11444#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11443#L12-2 assume !!(main_~i~0 < main_~j~0); 11442#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11441#L12-2 assume !!(main_~i~0 < main_~j~0); 11440#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11439#L12-2 assume !!(main_~i~0 < main_~j~0); 11438#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11437#L12-2 assume !!(main_~i~0 < main_~j~0); 11436#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11435#L12-2 assume !!(main_~i~0 < main_~j~0); 11434#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11433#L12-2 assume !!(main_~i~0 < main_~j~0); 11432#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11431#L12-2 assume !!(main_~i~0 < main_~j~0); 11430#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11429#L12-2 assume !!(main_~i~0 < main_~j~0); 11428#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11427#L12-2 assume !!(main_~i~0 < main_~j~0); 11426#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11425#L12-2 assume !!(main_~i~0 < main_~j~0); 11424#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11423#L12-2 assume !!(main_~i~0 < main_~j~0); 11422#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11421#L12-2 assume !!(main_~i~0 < main_~j~0); 11420#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11419#L12-2 assume !!(main_~i~0 < main_~j~0); 11418#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11417#L12-2 assume !!(main_~i~0 < main_~j~0); 11416#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11415#L12-2 assume !!(main_~i~0 < main_~j~0); 11414#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11413#L12-2 assume !!(main_~i~0 < main_~j~0); 11412#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11411#L12-2 assume !!(main_~i~0 < main_~j~0); 11410#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11409#L12-2 assume !!(main_~i~0 < main_~j~0); 11407#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11406#L12-2 assume !!(main_~i~0 < main_~j~0); 11405#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11404#L12-2 assume !!(main_~i~0 < main_~j~0); 11401#L12 [2020-11-30 00:45:23,965 INFO L796 eck$LassoCheckResult]: Loop: 11401#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 11402#L12-2 assume !!(main_~i~0 < main_~j~0); 11405#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11404#L12-2 assume !!(main_~i~0 < main_~j~0); 11401#L12 [2020-11-30 00:45:23,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:23,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1425194900, now seen corresponding path program 42 times [2020-11-30 00:45:23,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:23,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306305668] [2020-11-30 00:45:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:23,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:24,013 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:24,017 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:24,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:24,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 40 times [2020-11-30 00:45:24,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:24,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724320855] [2020-11-30 00:45:24,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:24,020 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:24,022 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:24,022 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:24,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:24,023 INFO L82 PathProgramCache]: Analyzing trace with hash -395959516, now seen corresponding path program 42 times [2020-11-30 00:45:24,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:24,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828729371] [2020-11-30 00:45:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 129 proven. 1806 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:25,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828729371] [2020-11-30 00:45:25,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154930843] [2020-11-30 00:45:25,419 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:25,497 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2020-11-30 00:45:25,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:25,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 44 conjunts are in the unsatisfiable core [2020-11-30 00:45:25,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 129 proven. 1806 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:25,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:25,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2020-11-30 00:45:25,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930875972] [2020-11-30 00:45:25,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:25,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2020-11-30 00:45:25,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2020-11-30 00:45:25,622 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. cyclomatic complexity: 3 Second operand 45 states. [2020-11-30 00:45:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:25,817 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2020-11-30 00:45:25,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-11-30 00:45:25,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 95 transitions. [2020-11-30 00:45:25,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:25,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 94 transitions. [2020-11-30 00:45:25,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:25,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:25,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 94 transitions. [2020-11-30 00:45:25,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:25,820 INFO L691 BuchiCegarLoop]: Abstraction has 92 states and 94 transitions. [2020-11-30 00:45:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 94 transitions. [2020-11-30 00:45:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2020-11-30 00:45:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-30 00:45:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2020-11-30 00:45:25,855 INFO L714 BuchiCegarLoop]: Abstraction has 91 states and 93 transitions. [2020-11-30 00:45:25,855 INFO L594 BuchiCegarLoop]: Abstraction has 91 states and 93 transitions. [2020-11-30 00:45:25,855 INFO L427 BuchiCegarLoop]: ======== Iteration 45============ [2020-11-30 00:45:25,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 93 transitions. [2020-11-30 00:45:25,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:25,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:25,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:25,857 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [44, 43, 1] [2020-11-30 00:45:25,857 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:25,858 INFO L794 eck$LassoCheckResult]: Stem: 11899#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 11895#L12-2 assume !!(main_~i~0 < main_~j~0); 11896#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11897#L12-2 assume !!(main_~i~0 < main_~j~0); 11898#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11902#L12-2 assume !!(main_~i~0 < main_~j~0); 11985#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11984#L12-2 assume !!(main_~i~0 < main_~j~0); 11983#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11982#L12-2 assume !!(main_~i~0 < main_~j~0); 11981#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11980#L12-2 assume !!(main_~i~0 < main_~j~0); 11979#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11978#L12-2 assume !!(main_~i~0 < main_~j~0); 11977#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11976#L12-2 assume !!(main_~i~0 < main_~j~0); 11975#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11974#L12-2 assume !!(main_~i~0 < main_~j~0); 11973#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11972#L12-2 assume !!(main_~i~0 < main_~j~0); 11971#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11970#L12-2 assume !!(main_~i~0 < main_~j~0); 11969#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11968#L12-2 assume !!(main_~i~0 < main_~j~0); 11967#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11966#L12-2 assume !!(main_~i~0 < main_~j~0); 11965#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11964#L12-2 assume !!(main_~i~0 < main_~j~0); 11963#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11962#L12-2 assume !!(main_~i~0 < main_~j~0); 11961#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11960#L12-2 assume !!(main_~i~0 < main_~j~0); 11959#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11958#L12-2 assume !!(main_~i~0 < main_~j~0); 11957#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11956#L12-2 assume !!(main_~i~0 < main_~j~0); 11955#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11954#L12-2 assume !!(main_~i~0 < main_~j~0); 11953#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11952#L12-2 assume !!(main_~i~0 < main_~j~0); 11951#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11950#L12-2 assume !!(main_~i~0 < main_~j~0); 11949#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11948#L12-2 assume !!(main_~i~0 < main_~j~0); 11947#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11946#L12-2 assume !!(main_~i~0 < main_~j~0); 11945#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11944#L12-2 assume !!(main_~i~0 < main_~j~0); 11943#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11942#L12-2 assume !!(main_~i~0 < main_~j~0); 11941#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11940#L12-2 assume !!(main_~i~0 < main_~j~0); 11939#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11938#L12-2 assume !!(main_~i~0 < main_~j~0); 11937#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11936#L12-2 assume !!(main_~i~0 < main_~j~0); 11935#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11934#L12-2 assume !!(main_~i~0 < main_~j~0); 11933#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11932#L12-2 assume !!(main_~i~0 < main_~j~0); 11931#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11930#L12-2 assume !!(main_~i~0 < main_~j~0); 11929#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11928#L12-2 assume !!(main_~i~0 < main_~j~0); 11927#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11926#L12-2 assume !!(main_~i~0 < main_~j~0); 11925#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11924#L12-2 assume !!(main_~i~0 < main_~j~0); 11923#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11922#L12-2 assume !!(main_~i~0 < main_~j~0); 11921#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11920#L12-2 assume !!(main_~i~0 < main_~j~0); 11919#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11918#L12-2 assume !!(main_~i~0 < main_~j~0); 11917#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11916#L12-2 assume !!(main_~i~0 < main_~j~0); 11915#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11914#L12-2 assume !!(main_~i~0 < main_~j~0); 11913#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11912#L12-2 assume !!(main_~i~0 < main_~j~0); 11911#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11910#L12-2 assume !!(main_~i~0 < main_~j~0); 11909#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11908#L12-2 assume !!(main_~i~0 < main_~j~0); 11906#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11905#L12-2 assume !!(main_~i~0 < main_~j~0); 11904#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11903#L12-2 assume !!(main_~i~0 < main_~j~0); 11900#L12 [2020-11-30 00:45:25,858 INFO L796 eck$LassoCheckResult]: Loop: 11900#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 11901#L12-2 assume !!(main_~i~0 < main_~j~0); 11904#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 11903#L12-2 assume !!(main_~i~0 < main_~j~0); 11900#L12 [2020-11-30 00:45:25,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:25,859 INFO L82 PathProgramCache]: Analyzing trace with hash 482268937, now seen corresponding path program 43 times [2020-11-30 00:45:25,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:25,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453386882] [2020-11-30 00:45:25,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:25,890 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:25,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:25,923 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:25,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:25,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 41 times [2020-11-30 00:45:25,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:25,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681268878] [2020-11-30 00:45:25,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:25,927 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:25,929 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:25,929 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:25,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1677796161, now seen corresponding path program 43 times [2020-11-30 00:45:25,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:25,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479916681] [2020-11-30 00:45:25,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 132 proven. 1892 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:27,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479916681] [2020-11-30 00:45:27,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591944127] [2020-11-30 00:45:27,249 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:27,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 45 conjunts are in the unsatisfiable core [2020-11-30 00:45:27,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 132 proven. 1892 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:27,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:27,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2020-11-30 00:45:27,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925636213] [2020-11-30 00:45:27,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:27,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-11-30 00:45:27,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2020-11-30 00:45:27,403 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. cyclomatic complexity: 3 Second operand 46 states. [2020-11-30 00:45:27,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:27,556 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2020-11-30 00:45:27,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-11-30 00:45:27,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 97 transitions. [2020-11-30 00:45:27,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:27,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 94 states and 96 transitions. [2020-11-30 00:45:27,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:27,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:27,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 96 transitions. [2020-11-30 00:45:27,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:27,559 INFO L691 BuchiCegarLoop]: Abstraction has 94 states and 96 transitions. [2020-11-30 00:45:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 96 transitions. [2020-11-30 00:45:27,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2020-11-30 00:45:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-30 00:45:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2020-11-30 00:45:27,561 INFO L714 BuchiCegarLoop]: Abstraction has 93 states and 95 transitions. [2020-11-30 00:45:27,561 INFO L594 BuchiCegarLoop]: Abstraction has 93 states and 95 transitions. [2020-11-30 00:45:27,561 INFO L427 BuchiCegarLoop]: ======== Iteration 46============ [2020-11-30 00:45:27,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 95 transitions. [2020-11-30 00:45:27,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:27,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:27,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:27,563 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [45, 44, 1] [2020-11-30 00:45:27,563 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:27,563 INFO L794 eck$LassoCheckResult]: Stem: 12409#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 12405#L12-2 assume !!(main_~i~0 < main_~j~0); 12406#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12407#L12-2 assume !!(main_~i~0 < main_~j~0); 12408#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12412#L12-2 assume !!(main_~i~0 < main_~j~0); 12497#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12496#L12-2 assume !!(main_~i~0 < main_~j~0); 12495#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12494#L12-2 assume !!(main_~i~0 < main_~j~0); 12493#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12492#L12-2 assume !!(main_~i~0 < main_~j~0); 12491#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12490#L12-2 assume !!(main_~i~0 < main_~j~0); 12489#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12488#L12-2 assume !!(main_~i~0 < main_~j~0); 12487#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12486#L12-2 assume !!(main_~i~0 < main_~j~0); 12485#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12484#L12-2 assume !!(main_~i~0 < main_~j~0); 12483#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12482#L12-2 assume !!(main_~i~0 < main_~j~0); 12481#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12480#L12-2 assume !!(main_~i~0 < main_~j~0); 12479#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12478#L12-2 assume !!(main_~i~0 < main_~j~0); 12477#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12476#L12-2 assume !!(main_~i~0 < main_~j~0); 12475#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12474#L12-2 assume !!(main_~i~0 < main_~j~0); 12473#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12472#L12-2 assume !!(main_~i~0 < main_~j~0); 12471#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12470#L12-2 assume !!(main_~i~0 < main_~j~0); 12469#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12468#L12-2 assume !!(main_~i~0 < main_~j~0); 12467#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12466#L12-2 assume !!(main_~i~0 < main_~j~0); 12465#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12464#L12-2 assume !!(main_~i~0 < main_~j~0); 12463#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12462#L12-2 assume !!(main_~i~0 < main_~j~0); 12461#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12460#L12-2 assume !!(main_~i~0 < main_~j~0); 12459#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12458#L12-2 assume !!(main_~i~0 < main_~j~0); 12457#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12456#L12-2 assume !!(main_~i~0 < main_~j~0); 12455#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12454#L12-2 assume !!(main_~i~0 < main_~j~0); 12453#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12452#L12-2 assume !!(main_~i~0 < main_~j~0); 12451#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12450#L12-2 assume !!(main_~i~0 < main_~j~0); 12449#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12448#L12-2 assume !!(main_~i~0 < main_~j~0); 12447#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12446#L12-2 assume !!(main_~i~0 < main_~j~0); 12445#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12444#L12-2 assume !!(main_~i~0 < main_~j~0); 12443#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12442#L12-2 assume !!(main_~i~0 < main_~j~0); 12441#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12440#L12-2 assume !!(main_~i~0 < main_~j~0); 12439#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12438#L12-2 assume !!(main_~i~0 < main_~j~0); 12437#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12436#L12-2 assume !!(main_~i~0 < main_~j~0); 12435#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12434#L12-2 assume !!(main_~i~0 < main_~j~0); 12433#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12432#L12-2 assume !!(main_~i~0 < main_~j~0); 12431#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12430#L12-2 assume !!(main_~i~0 < main_~j~0); 12429#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12428#L12-2 assume !!(main_~i~0 < main_~j~0); 12427#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12426#L12-2 assume !!(main_~i~0 < main_~j~0); 12425#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12424#L12-2 assume !!(main_~i~0 < main_~j~0); 12423#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12422#L12-2 assume !!(main_~i~0 < main_~j~0); 12421#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12420#L12-2 assume !!(main_~i~0 < main_~j~0); 12419#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12418#L12-2 assume !!(main_~i~0 < main_~j~0); 12416#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12415#L12-2 assume !!(main_~i~0 < main_~j~0); 12414#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12413#L12-2 assume !!(main_~i~0 < main_~j~0); 12410#L12 [2020-11-30 00:45:27,563 INFO L796 eck$LassoCheckResult]: Loop: 12410#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 12411#L12-2 assume !!(main_~i~0 < main_~j~0); 12414#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12413#L12-2 assume !!(main_~i~0 < main_~j~0); 12410#L12 [2020-11-30 00:45:27,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:27,564 INFO L82 PathProgramCache]: Analyzing trace with hash -396019098, now seen corresponding path program 44 times [2020-11-30 00:45:27,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:27,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968275701] [2020-11-30 00:45:27,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:27,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:27,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:27,617 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:27,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 42 times [2020-11-30 00:45:27,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:27,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874771049] [2020-11-30 00:45:27,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:27,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:27,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:27,623 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:27,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:27,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1692176414, now seen corresponding path program 44 times [2020-11-30 00:45:27,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:27,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613873830] [2020-11-30 00:45:27,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 135 proven. 1980 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:28,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613873830] [2020-11-30 00:45:28,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810863055] [2020-11-30 00:45:28,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:29,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:45:29,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:29,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 46 conjunts are in the unsatisfiable core [2020-11-30 00:45:29,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 135 proven. 1980 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:29,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:29,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2020-11-30 00:45:29,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166912513] [2020-11-30 00:45:29,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2020-11-30 00:45:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2020-11-30 00:45:29,171 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. cyclomatic complexity: 3 Second operand 47 states. [2020-11-30 00:45:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:29,336 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2020-11-30 00:45:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-11-30 00:45:29,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 99 transitions. [2020-11-30 00:45:29,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:29,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 96 states and 98 transitions. [2020-11-30 00:45:29,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:29,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:29,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 98 transitions. [2020-11-30 00:45:29,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:29,339 INFO L691 BuchiCegarLoop]: Abstraction has 96 states and 98 transitions. [2020-11-30 00:45:29,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 98 transitions. [2020-11-30 00:45:29,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2020-11-30 00:45:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-30 00:45:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2020-11-30 00:45:29,342 INFO L714 BuchiCegarLoop]: Abstraction has 95 states and 97 transitions. [2020-11-30 00:45:29,342 INFO L594 BuchiCegarLoop]: Abstraction has 95 states and 97 transitions. [2020-11-30 00:45:29,342 INFO L427 BuchiCegarLoop]: ======== Iteration 47============ [2020-11-30 00:45:29,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 97 transitions. [2020-11-30 00:45:29,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:29,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:29,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:29,344 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [46, 45, 1] [2020-11-30 00:45:29,344 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:29,344 INFO L794 eck$LassoCheckResult]: Stem: 12930#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 12926#L12-2 assume !!(main_~i~0 < main_~j~0); 12927#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12928#L12-2 assume !!(main_~i~0 < main_~j~0); 12929#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12933#L12-2 assume !!(main_~i~0 < main_~j~0); 13020#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13019#L12-2 assume !!(main_~i~0 < main_~j~0); 13018#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13017#L12-2 assume !!(main_~i~0 < main_~j~0); 13016#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13015#L12-2 assume !!(main_~i~0 < main_~j~0); 13014#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13013#L12-2 assume !!(main_~i~0 < main_~j~0); 13012#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13011#L12-2 assume !!(main_~i~0 < main_~j~0); 13010#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13009#L12-2 assume !!(main_~i~0 < main_~j~0); 13008#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13007#L12-2 assume !!(main_~i~0 < main_~j~0); 13006#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13005#L12-2 assume !!(main_~i~0 < main_~j~0); 13004#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13003#L12-2 assume !!(main_~i~0 < main_~j~0); 13002#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13001#L12-2 assume !!(main_~i~0 < main_~j~0); 13000#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12999#L12-2 assume !!(main_~i~0 < main_~j~0); 12998#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12997#L12-2 assume !!(main_~i~0 < main_~j~0); 12996#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12995#L12-2 assume !!(main_~i~0 < main_~j~0); 12994#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12993#L12-2 assume !!(main_~i~0 < main_~j~0); 12992#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12991#L12-2 assume !!(main_~i~0 < main_~j~0); 12990#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12989#L12-2 assume !!(main_~i~0 < main_~j~0); 12988#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12987#L12-2 assume !!(main_~i~0 < main_~j~0); 12986#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12985#L12-2 assume !!(main_~i~0 < main_~j~0); 12984#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12983#L12-2 assume !!(main_~i~0 < main_~j~0); 12982#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12981#L12-2 assume !!(main_~i~0 < main_~j~0); 12980#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12979#L12-2 assume !!(main_~i~0 < main_~j~0); 12978#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12977#L12-2 assume !!(main_~i~0 < main_~j~0); 12976#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12975#L12-2 assume !!(main_~i~0 < main_~j~0); 12974#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12973#L12-2 assume !!(main_~i~0 < main_~j~0); 12972#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12971#L12-2 assume !!(main_~i~0 < main_~j~0); 12970#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12969#L12-2 assume !!(main_~i~0 < main_~j~0); 12968#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12967#L12-2 assume !!(main_~i~0 < main_~j~0); 12966#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12965#L12-2 assume !!(main_~i~0 < main_~j~0); 12964#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12963#L12-2 assume !!(main_~i~0 < main_~j~0); 12962#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12961#L12-2 assume !!(main_~i~0 < main_~j~0); 12960#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12959#L12-2 assume !!(main_~i~0 < main_~j~0); 12958#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12957#L12-2 assume !!(main_~i~0 < main_~j~0); 12956#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12955#L12-2 assume !!(main_~i~0 < main_~j~0); 12954#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12953#L12-2 assume !!(main_~i~0 < main_~j~0); 12952#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12951#L12-2 assume !!(main_~i~0 < main_~j~0); 12950#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12949#L12-2 assume !!(main_~i~0 < main_~j~0); 12948#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12947#L12-2 assume !!(main_~i~0 < main_~j~0); 12946#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12945#L12-2 assume !!(main_~i~0 < main_~j~0); 12944#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12943#L12-2 assume !!(main_~i~0 < main_~j~0); 12942#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12941#L12-2 assume !!(main_~i~0 < main_~j~0); 12940#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12939#L12-2 assume !!(main_~i~0 < main_~j~0); 12937#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12936#L12-2 assume !!(main_~i~0 < main_~j~0); 12935#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12934#L12-2 assume !!(main_~i~0 < main_~j~0); 12931#L12 [2020-11-30 00:45:29,344 INFO L796 eck$LassoCheckResult]: Loop: 12931#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 12932#L12-2 assume !!(main_~i~0 < main_~j~0); 12935#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 12934#L12-2 assume !!(main_~i~0 < main_~j~0); 12931#L12 [2020-11-30 00:45:29,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:29,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1677736579, now seen corresponding path program 45 times [2020-11-30 00:45:29,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:29,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875331403] [2020-11-30 00:45:29,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:29,371 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:29,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:29,400 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:29,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:29,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 43 times [2020-11-30 00:45:29,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:29,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911495376] [2020-11-30 00:45:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:29,403 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:29,405 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:29,405 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:29,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:29,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1668269637, now seen corresponding path program 45 times [2020-11-30 00:45:29,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:29,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126371890] [2020-11-30 00:45:29,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 138 proven. 2070 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:30,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126371890] [2020-11-30 00:45:30,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654882087] [2020-11-30 00:45:30,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:30,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2020-11-30 00:45:30,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:30,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 47 conjunts are in the unsatisfiable core [2020-11-30 00:45:30,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 138 proven. 2070 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:30,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:30,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2020-11-30 00:45:30,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474977790] [2020-11-30 00:45:31,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:31,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2020-11-30 00:45:31,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2020-11-30 00:45:31,072 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. cyclomatic complexity: 3 Second operand 48 states. [2020-11-30 00:45:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:31,327 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2020-11-30 00:45:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-11-30 00:45:31,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 101 transitions. [2020-11-30 00:45:31,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:31,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 98 states and 100 transitions. [2020-11-30 00:45:31,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:31,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:31,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 100 transitions. [2020-11-30 00:45:31,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:31,330 INFO L691 BuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2020-11-30 00:45:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 100 transitions. [2020-11-30 00:45:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2020-11-30 00:45:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-30 00:45:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2020-11-30 00:45:31,334 INFO L714 BuchiCegarLoop]: Abstraction has 97 states and 99 transitions. [2020-11-30 00:45:31,334 INFO L594 BuchiCegarLoop]: Abstraction has 97 states and 99 transitions. [2020-11-30 00:45:31,335 INFO L427 BuchiCegarLoop]: ======== Iteration 48============ [2020-11-30 00:45:31,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 99 transitions. [2020-11-30 00:45:31,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:31,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:31,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:31,337 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [47, 46, 1] [2020-11-30 00:45:31,337 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:31,337 INFO L794 eck$LassoCheckResult]: Stem: 13462#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 13458#L12-2 assume !!(main_~i~0 < main_~j~0); 13459#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13460#L12-2 assume !!(main_~i~0 < main_~j~0); 13461#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13465#L12-2 assume !!(main_~i~0 < main_~j~0); 13554#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13553#L12-2 assume !!(main_~i~0 < main_~j~0); 13552#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13551#L12-2 assume !!(main_~i~0 < main_~j~0); 13550#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13549#L12-2 assume !!(main_~i~0 < main_~j~0); 13548#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13547#L12-2 assume !!(main_~i~0 < main_~j~0); 13546#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13545#L12-2 assume !!(main_~i~0 < main_~j~0); 13544#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13543#L12-2 assume !!(main_~i~0 < main_~j~0); 13542#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13541#L12-2 assume !!(main_~i~0 < main_~j~0); 13540#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13539#L12-2 assume !!(main_~i~0 < main_~j~0); 13538#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13537#L12-2 assume !!(main_~i~0 < main_~j~0); 13536#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13535#L12-2 assume !!(main_~i~0 < main_~j~0); 13534#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13533#L12-2 assume !!(main_~i~0 < main_~j~0); 13532#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13531#L12-2 assume !!(main_~i~0 < main_~j~0); 13530#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13529#L12-2 assume !!(main_~i~0 < main_~j~0); 13528#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13527#L12-2 assume !!(main_~i~0 < main_~j~0); 13526#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13525#L12-2 assume !!(main_~i~0 < main_~j~0); 13524#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13523#L12-2 assume !!(main_~i~0 < main_~j~0); 13522#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13521#L12-2 assume !!(main_~i~0 < main_~j~0); 13520#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13519#L12-2 assume !!(main_~i~0 < main_~j~0); 13518#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13517#L12-2 assume !!(main_~i~0 < main_~j~0); 13516#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13515#L12-2 assume !!(main_~i~0 < main_~j~0); 13514#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13513#L12-2 assume !!(main_~i~0 < main_~j~0); 13512#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13511#L12-2 assume !!(main_~i~0 < main_~j~0); 13510#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13509#L12-2 assume !!(main_~i~0 < main_~j~0); 13508#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13507#L12-2 assume !!(main_~i~0 < main_~j~0); 13506#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13505#L12-2 assume !!(main_~i~0 < main_~j~0); 13504#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13503#L12-2 assume !!(main_~i~0 < main_~j~0); 13502#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13501#L12-2 assume !!(main_~i~0 < main_~j~0); 13500#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13499#L12-2 assume !!(main_~i~0 < main_~j~0); 13498#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13497#L12-2 assume !!(main_~i~0 < main_~j~0); 13496#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13495#L12-2 assume !!(main_~i~0 < main_~j~0); 13494#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13493#L12-2 assume !!(main_~i~0 < main_~j~0); 13492#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13491#L12-2 assume !!(main_~i~0 < main_~j~0); 13490#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13489#L12-2 assume !!(main_~i~0 < main_~j~0); 13488#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13487#L12-2 assume !!(main_~i~0 < main_~j~0); 13486#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13485#L12-2 assume !!(main_~i~0 < main_~j~0); 13484#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13483#L12-2 assume !!(main_~i~0 < main_~j~0); 13482#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13481#L12-2 assume !!(main_~i~0 < main_~j~0); 13480#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13479#L12-2 assume !!(main_~i~0 < main_~j~0); 13478#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13477#L12-2 assume !!(main_~i~0 < main_~j~0); 13476#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13475#L12-2 assume !!(main_~i~0 < main_~j~0); 13474#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13473#L12-2 assume !!(main_~i~0 < main_~j~0); 13472#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13471#L12-2 assume !!(main_~i~0 < main_~j~0); 13469#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13468#L12-2 assume !!(main_~i~0 < main_~j~0); 13467#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13466#L12-2 assume !!(main_~i~0 < main_~j~0); 13463#L12 [2020-11-30 00:45:31,338 INFO L796 eck$LassoCheckResult]: Loop: 13463#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 13464#L12-2 assume !!(main_~i~0 < main_~j~0); 13467#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 13466#L12-2 assume !!(main_~i~0 < main_~j~0); 13463#L12 [2020-11-30 00:45:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:31,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1692116832, now seen corresponding path program 46 times [2020-11-30 00:45:31,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:31,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248104170] [2020-11-30 00:45:31,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:31,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:31,390 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:31,394 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 44 times [2020-11-30 00:45:31,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:31,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138421254] [2020-11-30 00:45:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:31,403 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:31,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:31,405 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:31,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1241518056, now seen corresponding path program 46 times [2020-11-30 00:45:31,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:31,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549197551] [2020-11-30 00:45:31,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:33,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549197551] [2020-11-30 00:45:33,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145327247] [2020-11-30 00:45:33,132 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:33,202 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 00:45:33,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:33,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 48 conjunts are in the unsatisfiable core [2020-11-30 00:45:33,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 141 proven. 2162 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:33,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:33,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2020-11-30 00:45:33,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187751734] [2020-11-30 00:45:33,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:33,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2020-11-30 00:45:33,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2020-11-30 00:45:33,307 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. cyclomatic complexity: 3 Second operand 49 states. [2020-11-30 00:45:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:33,489 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2020-11-30 00:45:33,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-11-30 00:45:33,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 103 transitions. [2020-11-30 00:45:33,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:33,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 100 states and 102 transitions. [2020-11-30 00:45:33,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:33,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:33,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 102 transitions. [2020-11-30 00:45:33,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:33,492 INFO L691 BuchiCegarLoop]: Abstraction has 100 states and 102 transitions. [2020-11-30 00:45:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 102 transitions. [2020-11-30 00:45:33,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2020-11-30 00:45:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-30 00:45:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2020-11-30 00:45:33,494 INFO L714 BuchiCegarLoop]: Abstraction has 99 states and 101 transitions. [2020-11-30 00:45:33,494 INFO L594 BuchiCegarLoop]: Abstraction has 99 states and 101 transitions. [2020-11-30 00:45:33,494 INFO L427 BuchiCegarLoop]: ======== Iteration 49============ [2020-11-30 00:45:33,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 101 transitions. [2020-11-30 00:45:33,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:33,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:33,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:33,496 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [48, 47, 1] [2020-11-30 00:45:33,496 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:33,497 INFO L794 eck$LassoCheckResult]: Stem: 14005#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 14001#L12-2 assume !!(main_~i~0 < main_~j~0); 14002#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14003#L12-2 assume !!(main_~i~0 < main_~j~0); 14004#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14008#L12-2 assume !!(main_~i~0 < main_~j~0); 14099#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14098#L12-2 assume !!(main_~i~0 < main_~j~0); 14097#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14096#L12-2 assume !!(main_~i~0 < main_~j~0); 14095#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14094#L12-2 assume !!(main_~i~0 < main_~j~0); 14093#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14092#L12-2 assume !!(main_~i~0 < main_~j~0); 14091#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14090#L12-2 assume !!(main_~i~0 < main_~j~0); 14089#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14088#L12-2 assume !!(main_~i~0 < main_~j~0); 14087#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14086#L12-2 assume !!(main_~i~0 < main_~j~0); 14085#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14084#L12-2 assume !!(main_~i~0 < main_~j~0); 14083#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14082#L12-2 assume !!(main_~i~0 < main_~j~0); 14081#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14080#L12-2 assume !!(main_~i~0 < main_~j~0); 14079#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14078#L12-2 assume !!(main_~i~0 < main_~j~0); 14077#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14076#L12-2 assume !!(main_~i~0 < main_~j~0); 14075#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14074#L12-2 assume !!(main_~i~0 < main_~j~0); 14073#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14072#L12-2 assume !!(main_~i~0 < main_~j~0); 14071#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14070#L12-2 assume !!(main_~i~0 < main_~j~0); 14069#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14068#L12-2 assume !!(main_~i~0 < main_~j~0); 14067#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14066#L12-2 assume !!(main_~i~0 < main_~j~0); 14065#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14064#L12-2 assume !!(main_~i~0 < main_~j~0); 14063#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14062#L12-2 assume !!(main_~i~0 < main_~j~0); 14061#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14060#L12-2 assume !!(main_~i~0 < main_~j~0); 14059#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14058#L12-2 assume !!(main_~i~0 < main_~j~0); 14057#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14056#L12-2 assume !!(main_~i~0 < main_~j~0); 14055#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14054#L12-2 assume !!(main_~i~0 < main_~j~0); 14053#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14052#L12-2 assume !!(main_~i~0 < main_~j~0); 14051#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14050#L12-2 assume !!(main_~i~0 < main_~j~0); 14049#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14048#L12-2 assume !!(main_~i~0 < main_~j~0); 14047#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14046#L12-2 assume !!(main_~i~0 < main_~j~0); 14045#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14044#L12-2 assume !!(main_~i~0 < main_~j~0); 14043#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14042#L12-2 assume !!(main_~i~0 < main_~j~0); 14041#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14040#L12-2 assume !!(main_~i~0 < main_~j~0); 14039#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14038#L12-2 assume !!(main_~i~0 < main_~j~0); 14037#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14036#L12-2 assume !!(main_~i~0 < main_~j~0); 14035#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14034#L12-2 assume !!(main_~i~0 < main_~j~0); 14033#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14032#L12-2 assume !!(main_~i~0 < main_~j~0); 14031#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14030#L12-2 assume !!(main_~i~0 < main_~j~0); 14029#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14028#L12-2 assume !!(main_~i~0 < main_~j~0); 14027#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14026#L12-2 assume !!(main_~i~0 < main_~j~0); 14025#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14024#L12-2 assume !!(main_~i~0 < main_~j~0); 14023#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14022#L12-2 assume !!(main_~i~0 < main_~j~0); 14021#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14020#L12-2 assume !!(main_~i~0 < main_~j~0); 14019#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14018#L12-2 assume !!(main_~i~0 < main_~j~0); 14017#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14016#L12-2 assume !!(main_~i~0 < main_~j~0); 14015#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14014#L12-2 assume !!(main_~i~0 < main_~j~0); 14012#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14011#L12-2 assume !!(main_~i~0 < main_~j~0); 14010#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14009#L12-2 assume !!(main_~i~0 < main_~j~0); 14006#L12 [2020-11-30 00:45:33,497 INFO L796 eck$LassoCheckResult]: Loop: 14006#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 14007#L12-2 assume !!(main_~i~0 < main_~j~0); 14010#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14009#L12-2 assume !!(main_~i~0 < main_~j~0); 14006#L12 [2020-11-30 00:45:33,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:33,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1668329219, now seen corresponding path program 47 times [2020-11-30 00:45:33,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:33,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82281174] [2020-11-30 00:45:33,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:33,518 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:33,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:33,545 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:33,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:33,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 45 times [2020-11-30 00:45:33,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:33,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040005653] [2020-11-30 00:45:33,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:33,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:33,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:33,550 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:33,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:33,550 INFO L82 PathProgramCache]: Analyzing trace with hash 844858165, now seen corresponding path program 47 times [2020-11-30 00:45:33,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:33,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603241632] [2020-11-30 00:45:33,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 144 proven. 2256 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:35,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603241632] [2020-11-30 00:45:35,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788862224] [2020-11-30 00:45:35,200 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:35,288 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2020-11-30 00:45:35,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:35,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 49 conjunts are in the unsatisfiable core [2020-11-30 00:45:35,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 144 proven. 2256 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:35,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:35,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2020-11-30 00:45:35,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561783127] [2020-11-30 00:45:35,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:35,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-11-30 00:45:35,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2020-11-30 00:45:35,384 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. cyclomatic complexity: 3 Second operand 50 states. [2020-11-30 00:45:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:35,571 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2020-11-30 00:45:35,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2020-11-30 00:45:35,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 105 transitions. [2020-11-30 00:45:35,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:35,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 102 states and 104 transitions. [2020-11-30 00:45:35,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:35,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:35,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 104 transitions. [2020-11-30 00:45:35,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:35,574 INFO L691 BuchiCegarLoop]: Abstraction has 102 states and 104 transitions. [2020-11-30 00:45:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 104 transitions. [2020-11-30 00:45:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2020-11-30 00:45:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-30 00:45:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2020-11-30 00:45:35,576 INFO L714 BuchiCegarLoop]: Abstraction has 101 states and 103 transitions. [2020-11-30 00:45:35,576 INFO L594 BuchiCegarLoop]: Abstraction has 101 states and 103 transitions. [2020-11-30 00:45:35,576 INFO L427 BuchiCegarLoop]: ======== Iteration 50============ [2020-11-30 00:45:35,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 103 transitions. [2020-11-30 00:45:35,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:35,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:35,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:35,578 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [49, 48, 1] [2020-11-30 00:45:35,578 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:35,578 INFO L794 eck$LassoCheckResult]: Stem: 14559#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 14555#L12-2 assume !!(main_~i~0 < main_~j~0); 14556#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14557#L12-2 assume !!(main_~i~0 < main_~j~0); 14558#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14562#L12-2 assume !!(main_~i~0 < main_~j~0); 14655#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14654#L12-2 assume !!(main_~i~0 < main_~j~0); 14653#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14652#L12-2 assume !!(main_~i~0 < main_~j~0); 14651#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14650#L12-2 assume !!(main_~i~0 < main_~j~0); 14649#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14648#L12-2 assume !!(main_~i~0 < main_~j~0); 14647#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14646#L12-2 assume !!(main_~i~0 < main_~j~0); 14645#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14644#L12-2 assume !!(main_~i~0 < main_~j~0); 14643#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14642#L12-2 assume !!(main_~i~0 < main_~j~0); 14641#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14640#L12-2 assume !!(main_~i~0 < main_~j~0); 14639#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14638#L12-2 assume !!(main_~i~0 < main_~j~0); 14637#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14636#L12-2 assume !!(main_~i~0 < main_~j~0); 14635#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14634#L12-2 assume !!(main_~i~0 < main_~j~0); 14633#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14632#L12-2 assume !!(main_~i~0 < main_~j~0); 14631#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14630#L12-2 assume !!(main_~i~0 < main_~j~0); 14629#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14628#L12-2 assume !!(main_~i~0 < main_~j~0); 14627#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14626#L12-2 assume !!(main_~i~0 < main_~j~0); 14625#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14624#L12-2 assume !!(main_~i~0 < main_~j~0); 14623#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14622#L12-2 assume !!(main_~i~0 < main_~j~0); 14621#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14620#L12-2 assume !!(main_~i~0 < main_~j~0); 14619#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14618#L12-2 assume !!(main_~i~0 < main_~j~0); 14617#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14616#L12-2 assume !!(main_~i~0 < main_~j~0); 14615#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14614#L12-2 assume !!(main_~i~0 < main_~j~0); 14613#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14612#L12-2 assume !!(main_~i~0 < main_~j~0); 14611#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14610#L12-2 assume !!(main_~i~0 < main_~j~0); 14609#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14608#L12-2 assume !!(main_~i~0 < main_~j~0); 14607#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14606#L12-2 assume !!(main_~i~0 < main_~j~0); 14605#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14604#L12-2 assume !!(main_~i~0 < main_~j~0); 14603#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14602#L12-2 assume !!(main_~i~0 < main_~j~0); 14601#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14600#L12-2 assume !!(main_~i~0 < main_~j~0); 14599#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14598#L12-2 assume !!(main_~i~0 < main_~j~0); 14597#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14596#L12-2 assume !!(main_~i~0 < main_~j~0); 14595#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14594#L12-2 assume !!(main_~i~0 < main_~j~0); 14593#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14592#L12-2 assume !!(main_~i~0 < main_~j~0); 14591#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14590#L12-2 assume !!(main_~i~0 < main_~j~0); 14589#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14588#L12-2 assume !!(main_~i~0 < main_~j~0); 14587#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14586#L12-2 assume !!(main_~i~0 < main_~j~0); 14585#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14584#L12-2 assume !!(main_~i~0 < main_~j~0); 14583#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14582#L12-2 assume !!(main_~i~0 < main_~j~0); 14581#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14580#L12-2 assume !!(main_~i~0 < main_~j~0); 14579#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14578#L12-2 assume !!(main_~i~0 < main_~j~0); 14577#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14576#L12-2 assume !!(main_~i~0 < main_~j~0); 14575#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14574#L12-2 assume !!(main_~i~0 < main_~j~0); 14573#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14572#L12-2 assume !!(main_~i~0 < main_~j~0); 14571#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14570#L12-2 assume !!(main_~i~0 < main_~j~0); 14569#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14568#L12-2 assume !!(main_~i~0 < main_~j~0); 14566#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14565#L12-2 assume !!(main_~i~0 < main_~j~0); 14564#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14563#L12-2 assume !!(main_~i~0 < main_~j~0); 14560#L12 [2020-11-30 00:45:35,579 INFO L796 eck$LassoCheckResult]: Loop: 14560#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 14561#L12-2 assume !!(main_~i~0 < main_~j~0); 14564#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 14563#L12-2 assume !!(main_~i~0 < main_~j~0); 14560#L12 [2020-11-30 00:45:35,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:35,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1241577638, now seen corresponding path program 48 times [2020-11-30 00:45:35,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:35,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981500446] [2020-11-30 00:45:35,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:35,609 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:35,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:35,643 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:35,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:35,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 46 times [2020-11-30 00:45:35,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:35,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802910169] [2020-11-30 00:45:35,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:35,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:35,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:35,649 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:35,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:35,649 INFO L82 PathProgramCache]: Analyzing trace with hash 102679314, now seen corresponding path program 48 times [2020-11-30 00:45:35,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:35,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543268560] [2020-11-30 00:45:35,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:45:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 147 proven. 2352 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:37,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543268560] [2020-11-30 00:45:37,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250631398] [2020-11-30 00:45:37,216 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:45:37,344 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2020-11-30 00:45:37,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:45:37,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 50 conjunts are in the unsatisfiable core [2020-11-30 00:45:37,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:45:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 147 proven. 2352 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:45:37,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:45:37,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2020-11-30 00:45:37,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092075118] [2020-11-30 00:45:37,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:45:37,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2020-11-30 00:45:37,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2020-11-30 00:45:37,475 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. cyclomatic complexity: 3 Second operand 51 states. [2020-11-30 00:45:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:45:37,667 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2020-11-30 00:45:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-11-30 00:45:37,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 107 transitions. [2020-11-30 00:45:37,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:37,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 104 states and 106 transitions. [2020-11-30 00:45:37,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-11-30 00:45:37,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-11-30 00:45:37,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 106 transitions. [2020-11-30 00:45:37,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:45:37,670 INFO L691 BuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2020-11-30 00:45:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 106 transitions. [2020-11-30 00:45:37,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2020-11-30 00:45:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-11-30 00:45:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2020-11-30 00:45:37,673 INFO L714 BuchiCegarLoop]: Abstraction has 103 states and 105 transitions. [2020-11-30 00:45:37,673 INFO L594 BuchiCegarLoop]: Abstraction has 103 states and 105 transitions. [2020-11-30 00:45:37,673 INFO L427 BuchiCegarLoop]: ======== Iteration 51============ [2020-11-30 00:45:37,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 105 transitions. [2020-11-30 00:45:37,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:45:37,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:45:37,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:45:37,675 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [50, 49, 1] [2020-11-30 00:45:37,675 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-11-30 00:45:37,675 INFO L794 eck$LassoCheckResult]: Stem: 15124#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~j~0 := 100;main_~i~0 := 0; 15120#L12-2 assume !!(main_~i~0 < main_~j~0); 15121#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15122#L12-2 assume !!(main_~i~0 < main_~j~0); 15123#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15127#L12-2 assume !!(main_~i~0 < main_~j~0); 15222#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15221#L12-2 assume !!(main_~i~0 < main_~j~0); 15220#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15219#L12-2 assume !!(main_~i~0 < main_~j~0); 15218#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15217#L12-2 assume !!(main_~i~0 < main_~j~0); 15216#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15215#L12-2 assume !!(main_~i~0 < main_~j~0); 15214#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15213#L12-2 assume !!(main_~i~0 < main_~j~0); 15212#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15211#L12-2 assume !!(main_~i~0 < main_~j~0); 15210#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15209#L12-2 assume !!(main_~i~0 < main_~j~0); 15208#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15207#L12-2 assume !!(main_~i~0 < main_~j~0); 15206#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15205#L12-2 assume !!(main_~i~0 < main_~j~0); 15204#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15203#L12-2 assume !!(main_~i~0 < main_~j~0); 15202#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15201#L12-2 assume !!(main_~i~0 < main_~j~0); 15200#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15199#L12-2 assume !!(main_~i~0 < main_~j~0); 15198#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15197#L12-2 assume !!(main_~i~0 < main_~j~0); 15196#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15195#L12-2 assume !!(main_~i~0 < main_~j~0); 15194#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15193#L12-2 assume !!(main_~i~0 < main_~j~0); 15192#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15191#L12-2 assume !!(main_~i~0 < main_~j~0); 15190#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15189#L12-2 assume !!(main_~i~0 < main_~j~0); 15188#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15187#L12-2 assume !!(main_~i~0 < main_~j~0); 15186#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15185#L12-2 assume !!(main_~i~0 < main_~j~0); 15184#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15183#L12-2 assume !!(main_~i~0 < main_~j~0); 15182#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15181#L12-2 assume !!(main_~i~0 < main_~j~0); 15180#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15179#L12-2 assume !!(main_~i~0 < main_~j~0); 15178#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15177#L12-2 assume !!(main_~i~0 < main_~j~0); 15176#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15175#L12-2 assume !!(main_~i~0 < main_~j~0); 15174#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15173#L12-2 assume !!(main_~i~0 < main_~j~0); 15172#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15171#L12-2 assume !!(main_~i~0 < main_~j~0); 15170#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15169#L12-2 assume !!(main_~i~0 < main_~j~0); 15168#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15167#L12-2 assume !!(main_~i~0 < main_~j~0); 15166#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15165#L12-2 assume !!(main_~i~0 < main_~j~0); 15164#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15163#L12-2 assume !!(main_~i~0 < main_~j~0); 15162#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15161#L12-2 assume !!(main_~i~0 < main_~j~0); 15160#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15159#L12-2 assume !!(main_~i~0 < main_~j~0); 15158#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15157#L12-2 assume !!(main_~i~0 < main_~j~0); 15156#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15155#L12-2 assume !!(main_~i~0 < main_~j~0); 15154#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15153#L12-2 assume !!(main_~i~0 < main_~j~0); 15152#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15151#L12-2 assume !!(main_~i~0 < main_~j~0); 15150#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15149#L12-2 assume !!(main_~i~0 < main_~j~0); 15148#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15147#L12-2 assume !!(main_~i~0 < main_~j~0); 15146#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15145#L12-2 assume !!(main_~i~0 < main_~j~0); 15144#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15143#L12-2 assume !!(main_~i~0 < main_~j~0); 15142#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15141#L12-2 assume !!(main_~i~0 < main_~j~0); 15140#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15139#L12-2 assume !!(main_~i~0 < main_~j~0); 15138#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15137#L12-2 assume !!(main_~i~0 < main_~j~0); 15136#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15135#L12-2 assume !!(main_~i~0 < main_~j~0); 15134#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15133#L12-2 assume !!(main_~i~0 < main_~j~0); 15131#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15130#L12-2 assume !!(main_~i~0 < main_~j~0); 15129#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15128#L12-2 assume !!(main_~i~0 < main_~j~0); 15125#L12 [2020-11-30 00:45:37,676 INFO L796 eck$LassoCheckResult]: Loop: 15125#L12 assume !(51 < main_~j~0);main_~i~0 := main_~i~0 - 1;main_~j~0 := 1 + main_~j~0; 15126#L12-2 assume !!(main_~i~0 < main_~j~0); 15129#L12 assume 51 < main_~j~0;main_~i~0 := 1 + main_~i~0;main_~j~0 := main_~j~0 - 1; 15128#L12-2 assume !!(main_~i~0 < main_~j~0); 15125#L12 [2020-11-30 00:45:37,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:37,676 INFO L82 PathProgramCache]: Analyzing trace with hash 844798583, now seen corresponding path program 49 times [2020-11-30 00:45:37,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:37,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229040099] [2020-11-30 00:45:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:37,707 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:37,740 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:37,744 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:37,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 47 times [2020-11-30 00:45:37,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:37,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481492428] [2020-11-30 00:45:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:37,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:37,748 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:37,749 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:37,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:45:37,750 INFO L82 PathProgramCache]: Analyzing trace with hash -166625361, now seen corresponding path program 49 times [2020-11-30 00:45:37,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:45:37,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687750463] [2020-11-30 00:45:37,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:45:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:37,781 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:45:37,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:45:37,815 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:45:41,112 WARN L193 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 403 DAG size of output: 303 [2020-11-30 00:45:41,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 30.11 12:45:41 BoogieIcfgContainer [2020-11-30 00:45:41,182 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-30 00:45:41,182 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:45:41,182 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:45:41,183 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:45:41,183 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:44:43" (3/4) ... [2020-11-30 00:45:41,187 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-30 00:45:41,243 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_45db434d-d536-4db7-8bc0-1004444e26de/bin/uautomizer/witness.graphml [2020-11-30 00:45:41,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:45:41,244 INFO L168 Benchmark]: Toolchain (without parser) took 58329.31 ms. Allocated memory was 92.3 MB in the beginning and 723.5 MB in the end (delta: 631.2 MB). Free memory was 62.1 MB in the beginning and 270.4 MB in the end (delta: -208.3 MB). Peak memory consumption was 423.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:45:41,245 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 92.3 MB. Free memory is still 50.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:45:41,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.63 ms. Allocated memory is still 92.3 MB. Free memory was 62.0 MB in the beginning and 71.2 MB in the end (delta: -9.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:45:41,246 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.47 ms. Allocated memory is still 92.3 MB. Free memory was 71.2 MB in the beginning and 70.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:45:41,246 INFO L168 Benchmark]: Boogie Preprocessor took 22.30 ms. Allocated memory is still 92.3 MB. Free memory was 70.0 MB in the beginning and 69.0 MB in the end (delta: 973.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:45:41,246 INFO L168 Benchmark]: RCFGBuilder took 283.88 ms. Allocated memory is still 92.3 MB. Free memory was 69.0 MB in the beginning and 61.2 MB in the end (delta: 7.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:45:41,247 INFO L168 Benchmark]: BuchiAutomizer took 57652.82 ms. Allocated memory was 92.3 MB in the beginning and 723.5 MB in the end (delta: 631.2 MB). Free memory was 61.2 MB in the beginning and 273.6 MB in the end (delta: -212.3 MB). Peak memory consumption was 445.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:45:41,247 INFO L168 Benchmark]: Witness Printer took 60.93 ms. Allocated memory is still 723.5 MB. Free memory was 273.6 MB in the beginning and 270.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:45:41,250 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 92.3 MB. Free memory is still 50.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 255.63 ms. Allocated memory is still 92.3 MB. Free memory was 62.0 MB in the beginning and 71.2 MB in the end (delta: -9.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.47 ms. Allocated memory is still 92.3 MB. Free memory was 71.2 MB in the beginning and 70.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.30 ms. Allocated memory is still 92.3 MB. Free memory was 70.0 MB in the beginning and 69.0 MB in the end (delta: 973.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 283.88 ms. Allocated memory is still 92.3 MB. Free memory was 69.0 MB in the beginning and 61.2 MB in the end (delta: 7.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 57652.82 ms. Allocated memory was 92.3 MB in the beginning and 723.5 MB in the end (delta: 631.2 MB). Free memory was 61.2 MB in the beginning and 273.6 MB in the end (delta: -212.3 MB). Peak memory consumption was 445.4 MB. Max. memory is 16.1 GB. * Witness Printer took 60.93 ms. Allocated memory is still 723.5 MB. Free memory was 273.6 MB in the beginning and 270.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 53 terminating modules (49 trivial, 2 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function j and consists of 4 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function -2 * j + 103 and consists of 3 locations. 49 modules have a trivial ranking function, the largest among these consists of 51 locations. The remainder module has 103 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 57.5s and 51 iterations. TraceHistogramMax:50. Analysis of lassos took 50.0s. Construction of modules took 4.1s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 53. Automata minimization 0.2s AutomataMinimizationTime, 53 MinimizatonAttempts, 57 StatesRemovedByMinimization, 51 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 103 states and ocurred in iteration 50. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 126 SDtfs, 29 SDslu, 3 SDs, 0 SdLazy, 3392 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc46 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax165 hnf99 lsp59 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf93 smp100 dnf100 smp100 tf107 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, i=49, j=51} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j Loop: [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...