./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca35bd50d888047fd624bd95d9bb19453630de07 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.1.25-9a8b2e8 [2020-10-20 06:46:43,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:46:43,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:46:43,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:46:43,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:46:43,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:46:43,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:46:43,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:46:43,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:46:43,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:46:43,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:46:43,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:46:43,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:46:43,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:46:43,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:46:43,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:46:43,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:46:43,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:46:43,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:46:43,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:46:43,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:46:43,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:46:43,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:46:43,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:46:43,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:46:43,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:46:43,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:46:43,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:46:43,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:46:43,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:46:43,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:46:43,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:46:43,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:46:43,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:46:43,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:46:43,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:46:43,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:46:43,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:46:43,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:46:43,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:46:43,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:46:43,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 06:46:43,997 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:46:43,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:46:43,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:46:43,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:46:43,999 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:46:43,999 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:46:43,999 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:46:44,000 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:46:44,000 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:46:44,000 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:46:44,000 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:46:44,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:46:44,001 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:46:44,001 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:46:44,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:46:44,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:46:44,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:46:44,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:46:44,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:46:44,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:46:44,003 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:46:44,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:46:44,003 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:46:44,004 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:46:44,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:46:44,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:46:44,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:46:44,005 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:46:44,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:46:44,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:46:44,006 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:46:44,006 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:46:44,007 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:46:44,007 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ca35bd50d888047fd624bd95d9bb19453630de07 [2020-10-20 06:46:44,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:46:44,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:46:44,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:46:44,235 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:46:44,235 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:46:44,236 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2020-10-20 06:46:44,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63ed46d0/ccde4ff584d04bb6ae0556f318cc6e76/FLAG9ac65ca6e [2020-10-20 06:46:44,798 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:46:44,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2020-10-20 06:46:44,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63ed46d0/ccde4ff584d04bb6ae0556f318cc6e76/FLAG9ac65ca6e [2020-10-20 06:46:45,170 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63ed46d0/ccde4ff584d04bb6ae0556f318cc6e76 [2020-10-20 06:46:45,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:46:45,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:46:45,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:46:45,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:46:45,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:46:45,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:46:45" (1/1) ... [2020-10-20 06:46:45,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67bb0d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:45, skipping insertion in model container [2020-10-20 06:46:45,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:46:45" (1/1) ... [2020-10-20 06:46:45,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:46:45,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:46:45,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:46:45,506 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:46:45,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:46:45,551 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:46:45,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:45 WrapperNode [2020-10-20 06:46:45,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:46:45,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:46:45,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:46:45,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:46:45,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:45" (1/1) ... [2020-10-20 06:46:45,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:45" (1/1) ... [2020-10-20 06:46:45,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:46:45,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:46:45,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:46:45,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:46:45,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:45" (1/1) ... [2020-10-20 06:46:45,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:45" (1/1) ... [2020-10-20 06:46:45,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:45" (1/1) ... [2020-10-20 06:46:45,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:45" (1/1) ... [2020-10-20 06:46:45,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:45" (1/1) ... [2020-10-20 06:46:45,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:45" (1/1) ... [2020-10-20 06:46:45,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:45" (1/1) ... [2020-10-20 06:46:45,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:46:45,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:46:45,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:46:45,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:46:45,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:46:45,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:46:45,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:46:45,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:46:45,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:46:45,994 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:46:45,995 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-20 06:46:45,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:46:45 BoogieIcfgContainer [2020-10-20 06:46:45,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:46:45,998 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:46:45,999 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:46:46,002 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:46:46,003 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:46:46,004 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:46:45" (1/3) ... [2020-10-20 06:46:46,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dee255d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:46:46, skipping insertion in model container [2020-10-20 06:46:46,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:46:46,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:46:45" (2/3) ... [2020-10-20 06:46:46,006 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dee255d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:46:46, skipping insertion in model container [2020-10-20 06:46:46,006 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:46:46,006 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:46:45" (3/3) ... [2020-10-20 06:46:46,008 INFO L373 chiAutomizerObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2020-10-20 06:46:46,092 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:46:46,092 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:46:46,092 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:46:46,093 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:46:46,093 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:46:46,093 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:46:46,093 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:46:46,094 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:46:46,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-10-20 06:46:46,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-10-20 06:46:46,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:46,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:46,168 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:46:46,168 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 06:46:46,168 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:46:46,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-10-20 06:46:46,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-10-20 06:46:46,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:46,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:46,174 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:46:46,174 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 06:46:46,183 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 13#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 35#L178true [2020-10-20 06:46:46,184 INFO L796 eck$LassoCheckResult]: Loop: 35#L178true assume !false; 30#L25true assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 39#L31true assume 8466 == main_~s__state~0; 17#L32true assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 4#L80-1true main_~s__state~0 := 8496; 35#L178true [2020-10-20 06:46:46,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:46,192 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 06:46:46,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:46,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456031087] [2020-10-20 06:46:46,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:46,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:46,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:46,344 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:46,346 INFO L82 PathProgramCache]: Analyzing trace with hash 39285361, now seen corresponding path program 1 times [2020-10-20 06:46:46,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:46,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426525055] [2020-10-20 06:46:46,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:46,359 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:46,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:46,365 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:46,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:46,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1810724847, now seen corresponding path program 1 times [2020-10-20 06:46:46,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:46,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470286726] [2020-10-20 06:46:46,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:46,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:46,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:46,404 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:46,494 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:46,496 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:46,496 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:46,497 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:46,497 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:46:46,497 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:46,497 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:46,497 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:46,497 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration1_Loop [2020-10-20 06:46:46,497 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:46,498 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:46,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:46,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:46,597 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:46,598 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:46,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:46,604 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 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:46,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:46:46,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:46:46,641 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:46:46,674 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:46,674 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:46,674 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:46,674 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:46,674 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:46:46,675 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:46,675 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:46,675 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:46,675 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration1_Loop [2020-10-20 06:46:46,675 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:46,675 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:46,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:46,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:46,743 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:46,749 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:46,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-10-20 06:46:46,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:46,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:46,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:46,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:46,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:46,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:46,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:46,780 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:46:46,788 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:46:46,788 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:46,802 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:46:46,803 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:46:46,804 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:46:46,805 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8481 Supporting invariants [] Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:46,842 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:46:46,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:46,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:46,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:46,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:46,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:46,974 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-10-20 06:46:46,977 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states. Second operand 4 states. [2020-10-20 06:46:47,254 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states.. Second operand 4 states. Result 137 states and 207 transitions. Complement of second has 8 states. [2020-10-20 06:46:47,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:46:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:46:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2020-10-20 06:46:47,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 2 letters. Loop has 5 letters. [2020-10-20 06:46:47,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:47,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 7 letters. Loop has 5 letters. [2020-10-20 06:46:47,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:47,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 62 transitions. Stem has 2 letters. Loop has 10 letters. [2020-10-20 06:46:47,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:47,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 207 transitions. [2020-10-20 06:46:47,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-10-20 06:46:47,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 81 states and 128 transitions. [2020-10-20 06:46:47,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2020-10-20 06:46:47,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2020-10-20 06:46:47,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 128 transitions. [2020-10-20 06:46:47,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:47,286 INFO L691 BuchiCegarLoop]: Abstraction has 81 states and 128 transitions. [2020-10-20 06:46:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 128 transitions. [2020-10-20 06:46:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2020-10-20 06:46:47,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-20 06:46:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 74 transitions. [2020-10-20 06:46:47,337 INFO L714 BuchiCegarLoop]: Abstraction has 48 states and 74 transitions. [2020-10-20 06:46:47,337 INFO L594 BuchiCegarLoop]: Abstraction has 48 states and 74 transitions. [2020-10-20 06:46:47,337 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:46:47,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 74 transitions. [2020-10-20 06:46:47,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2020-10-20 06:46:47,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:47,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:47,350 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:46:47,350 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:46:47,350 INFO L794 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 252#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 253#L178 assume !false; 269#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 270#L31 assume !(8466 == main_~s__state~0); 265#L34 [2020-10-20 06:46:47,351 INFO L796 eck$LassoCheckResult]: Loop: 265#L34 assume 8496 == main_~s__state~0; 266#L35 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 264#L87-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 234#L178 assume !false; 274#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 280#L31 assume !(8466 == main_~s__state~0); 265#L34 [2020-10-20 06:46:47,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash 28699821, now seen corresponding path program 1 times [2020-10-20 06:46:47,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:47,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246031919] [2020-10-20 06:46:47,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:47,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246031919] [2020-10-20 06:46:47,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:47,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:46:47,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993141321] [2020-10-20 06:46:47,467 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:47,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:47,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1658744177, now seen corresponding path program 1 times [2020-10-20 06:46:47,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:47,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914787356] [2020-10-20 06:46:47,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:47,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:47,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:47,496 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:47,534 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:47,534 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:47,535 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:47,535 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:47,535 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:46:47,535 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:47,535 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:47,535 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:47,535 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration2_Loop [2020-10-20 06:46:47,535 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:47,536 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:47,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:47,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:47,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:47,605 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:47,605 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:47,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:47,616 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:47,621 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:46:47,621 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__hit~0=0} Honda state: {ULTIMATE.start_main_~s__hit~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:47,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:47,667 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:47,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:46:47,702 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:46:47,710 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:46:47,741 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:47,741 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:47,741 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:47,742 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:47,742 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:46:47,742 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:47,742 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:47,742 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:47,742 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration2_Loop [2020-10-20 06:46:47,742 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:47,743 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:47,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:47,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:47,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:47,808 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:47,809 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:47,817 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-10-20 06:46:47,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:47,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:47,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:47,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:47,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:47,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:47,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:47,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:47,848 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-10-20 06:46:47,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:47,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:47,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:47,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:47,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:47,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:47,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:47,855 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:46:47,858 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:46:47,859 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:46:47,866 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:46:47,867 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:46:47,867 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:46:47,867 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8504 Supporting invariants [] [2020-10-20 06:46:47,888 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:46:47,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:47,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:47,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:47,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:47,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:47,959 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:46:47,959 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 74 transitions. cyclomatic complexity: 28 Second operand 4 states. [2020-10-20 06:46:48,237 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 74 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 171 states and 259 transitions. Complement of second has 7 states. [2020-10-20 06:46:48,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:46:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:46:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2020-10-20 06:46:48,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-20 06:46:48,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:48,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 11 letters. Loop has 6 letters. [2020-10-20 06:46:48,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:48,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 5 letters. Loop has 12 letters. [2020-10-20 06:46:48,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:48,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 259 transitions. [2020-10-20 06:46:48,245 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2020-10-20 06:46:48,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 127 states and 197 transitions. [2020-10-20 06:46:48,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2020-10-20 06:46:48,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2020-10-20 06:46:48,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 197 transitions. [2020-10-20 06:46:48,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:48,249 INFO L691 BuchiCegarLoop]: Abstraction has 127 states and 197 transitions. [2020-10-20 06:46:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 197 transitions. [2020-10-20 06:46:48,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 69. [2020-10-20 06:46:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 06:46:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 105 transitions. [2020-10-20 06:46:48,256 INFO L714 BuchiCegarLoop]: Abstraction has 69 states and 105 transitions. [2020-10-20 06:46:48,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:48,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:48,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:48,262 INFO L87 Difference]: Start difference. First operand 69 states and 105 transitions. Second operand 3 states. [2020-10-20 06:46:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:48,344 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2020-10-20 06:46:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:48,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 111 transitions. [2020-10-20 06:46:48,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2020-10-20 06:46:48,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 74 states and 109 transitions. [2020-10-20 06:46:48,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2020-10-20 06:46:48,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2020-10-20 06:46:48,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 109 transitions. [2020-10-20 06:46:48,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:48,348 INFO L691 BuchiCegarLoop]: Abstraction has 74 states and 109 transitions. [2020-10-20 06:46:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 109 transitions. [2020-10-20 06:46:48,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2020-10-20 06:46:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 06:46:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2020-10-20 06:46:48,353 INFO L714 BuchiCegarLoop]: Abstraction has 72 states and 107 transitions. [2020-10-20 06:46:48,354 INFO L594 BuchiCegarLoop]: Abstraction has 72 states and 107 transitions. [2020-10-20 06:46:48,354 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:46:48,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 107 transitions. [2020-10-20 06:46:48,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2020-10-20 06:46:48,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:48,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:48,356 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:48,356 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 06:46:48,356 INFO L794 eck$LassoCheckResult]: Stem: 709#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 676#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 677#L178 assume !false; 698#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 699#L31 assume 8466 == main_~s__state~0; 722#L32 assume !(0 == main_~blastFlag~0); 721#L80-1 main_~s__state~0 := 8496; 720#L178 assume !false; 719#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 704#L31 assume !(8466 == main_~s__state~0); 705#L34 assume !(8496 == main_~s__state~0); 666#L38 [2020-10-20 06:46:48,356 INFO L796 eck$LassoCheckResult]: Loop: 666#L38 assume 8512 == main_~s__state~0; 667#L39 main_~s__state~0 := 8528; 660#L178 assume !false; 715#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 713#L31 assume !(8466 == main_~s__state~0); 712#L34 assume !(8496 == main_~s__state~0); 666#L38 [2020-10-20 06:46:48,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:48,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1257298039, now seen corresponding path program 1 times [2020-10-20 06:46:48,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:48,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318023080] [2020-10-20 06:46:48,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:48,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318023080] [2020-10-20 06:46:48,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:48,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:48,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527131813] [2020-10-20 06:46:48,384 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:48,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:48,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1809521393, now seen corresponding path program 1 times [2020-10-20 06:46:48,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:48,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494568873] [2020-10-20 06:46:48,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:48,390 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:48,393 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:48,395 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:48,414 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:48,415 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:48,415 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:48,415 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:48,415 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:46:48,415 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:48,415 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:48,416 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:48,416 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration3_Loop [2020-10-20 06:46:48,416 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:48,416 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:48,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:48,444 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:48,445 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:46:48,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:48,448 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:48,505 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:46:48,505 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:48,511 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:46:48,545 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:48,545 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:48,545 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:48,545 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:48,545 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:46:48,545 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:48,545 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:48,545 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:48,546 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration3_Loop [2020-10-20 06:46:48,546 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:48,546 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:48,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:48,569 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:48,570 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:48,585 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-10-20 06:46:48,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:48,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:48,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:48,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:48,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:48,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:48,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:48,609 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:46:48,612 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:46:48,612 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:48,624 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:46:48,624 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:46:48,624 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:46:48,625 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8520 Supporting invariants [] Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:48,664 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:46:48,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:48,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:48,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:48,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:48,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:48,726 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:46:48,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 107 transitions. cyclomatic complexity: 39 Second operand 4 states. [2020-10-20 06:46:48,988 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 107 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 230 states and 345 transitions. Complement of second has 9 states. [2020-10-20 06:46:48,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:46:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:46:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2020-10-20 06:46:48,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 130 transitions. Stem has 11 letters. Loop has 6 letters. [2020-10-20 06:46:48,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:48,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 130 transitions. Stem has 17 letters. Loop has 6 letters. [2020-10-20 06:46:48,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:48,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 130 transitions. Stem has 11 letters. Loop has 12 letters. [2020-10-20 06:46:48,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:48,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 345 transitions. [2020-10-20 06:46:48,996 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2020-10-20 06:46:48,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 180 states and 279 transitions. [2020-10-20 06:46:48,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2020-10-20 06:46:48,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2020-10-20 06:46:48,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 279 transitions. [2020-10-20 06:46:49,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:49,000 INFO L691 BuchiCegarLoop]: Abstraction has 180 states and 279 transitions. [2020-10-20 06:46:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 279 transitions. [2020-10-20 06:46:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 100. [2020-10-20 06:46:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-20 06:46:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 150 transitions. [2020-10-20 06:46:49,008 INFO L714 BuchiCegarLoop]: Abstraction has 100 states and 150 transitions. [2020-10-20 06:46:49,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:49,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:49,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:49,009 INFO L87 Difference]: Start difference. First operand 100 states and 150 transitions. Second operand 3 states. [2020-10-20 06:46:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:49,030 INFO L93 Difference]: Finished difference Result 103 states and 153 transitions. [2020-10-20 06:46:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:49,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 153 transitions. [2020-10-20 06:46:49,032 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 06:46:49,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 153 transitions. [2020-10-20 06:46:49,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2020-10-20 06:46:49,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2020-10-20 06:46:49,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 153 transitions. [2020-10-20 06:46:49,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:49,035 INFO L691 BuchiCegarLoop]: Abstraction has 103 states and 153 transitions. [2020-10-20 06:46:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 153 transitions. [2020-10-20 06:46:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-20 06:46:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-20 06:46:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 153 transitions. [2020-10-20 06:46:49,041 INFO L714 BuchiCegarLoop]: Abstraction has 103 states and 153 transitions. [2020-10-20 06:46:49,041 INFO L594 BuchiCegarLoop]: Abstraction has 103 states and 153 transitions. [2020-10-20 06:46:49,041 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:46:49,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 153 transitions. [2020-10-20 06:46:49,042 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2020-10-20 06:46:49,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:49,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:49,043 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:49,044 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:49,044 INFO L794 eck$LassoCheckResult]: Stem: 1293#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1261#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 1262#L178 assume !false; 1330#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1329#L31 assume 8466 == main_~s__state~0; 1326#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 1325#L80-1 main_~s__state~0 := 8496; 1323#L178 assume !false; 1322#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1321#L31 assume !(8466 == main_~s__state~0); 1320#L34 assume !(8496 == main_~s__state~0); 1296#L38 assume !(8512 == main_~s__state~0); 1251#L42 [2020-10-20 06:46:49,044 INFO L796 eck$LassoCheckResult]: Loop: 1251#L42 assume 8528 == main_~s__state~0; 1268#L43 main_~s__state~0 := 8544; 1244#L178 assume !false; 1306#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1302#L31 assume !(8466 == main_~s__state~0); 1297#L34 assume !(8496 == main_~s__state~0); 1295#L38 assume !(8512 == main_~s__state~0); 1251#L42 [2020-10-20 06:46:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1453473786, now seen corresponding path program 1 times [2020-10-20 06:46:49,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:49,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155886782] [2020-10-20 06:46:49,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:49,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:49,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155886782] [2020-10-20 06:46:49,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:49,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:49,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268848834] [2020-10-20 06:46:49,072 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:49,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:49,072 INFO L82 PathProgramCache]: Analyzing trace with hash 460397777, now seen corresponding path program 1 times [2020-10-20 06:46:49,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:49,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383644720] [2020-10-20 06:46:49,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:49,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:49,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:49,081 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:49,099 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:49,099 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:49,099 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:49,099 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:49,099 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:46:49,099 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:49,099 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:49,100 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:49,100 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration4_Loop [2020-10-20 06:46:49,100 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:49,100 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:49,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:49,133 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:49,133 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:46:49,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:49,136 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:49,174 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:46:49,174 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:46:49,178 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:46:49,199 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:49,200 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:49,200 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:49,200 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:49,200 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:46:49,200 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:49,200 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:49,200 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:49,200 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration4_Loop [2020-10-20 06:46:49,200 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:49,200 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:49,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:49,224 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:49,224 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:49,233 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-10-20 06:46:49,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:49,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:49,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:49,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:49,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:49,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:49,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:49,240 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:46:49,246 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:46:49,246 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:49,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:46:49,259 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:46:49,260 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:46:49,260 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8536 Supporting invariants [] [2020-10-20 06:46:49,280 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:46:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:49,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:49,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:49,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:49,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:49,343 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:46:49,343 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 103 states and 153 transitions. cyclomatic complexity: 56 Second operand 4 states. [2020-10-20 06:46:49,585 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 103 states and 153 transitions. cyclomatic complexity: 56. Second operand 4 states. Result 262 states and 395 transitions. Complement of second has 9 states. [2020-10-20 06:46:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:46:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:46:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2020-10-20 06:46:49,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 135 transitions. Stem has 12 letters. Loop has 7 letters. [2020-10-20 06:46:49,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:49,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 135 transitions. Stem has 19 letters. Loop has 7 letters. [2020-10-20 06:46:49,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:49,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 135 transitions. Stem has 12 letters. Loop has 14 letters. [2020-10-20 06:46:49,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:49,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 262 states and 395 transitions. [2020-10-20 06:46:49,590 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 74 [2020-10-20 06:46:49,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 262 states to 216 states and 333 transitions. [2020-10-20 06:46:49,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2020-10-20 06:46:49,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2020-10-20 06:46:49,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 333 transitions. [2020-10-20 06:46:49,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:49,594 INFO L691 BuchiCegarLoop]: Abstraction has 216 states and 333 transitions. [2020-10-20 06:46:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 333 transitions. [2020-10-20 06:46:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 137. [2020-10-20 06:46:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-20 06:46:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 206 transitions. [2020-10-20 06:46:49,601 INFO L714 BuchiCegarLoop]: Abstraction has 137 states and 206 transitions. [2020-10-20 06:46:49,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:49,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:49,602 INFO L87 Difference]: Start difference. First operand 137 states and 206 transitions. Second operand 3 states. [2020-10-20 06:46:49,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:49,658 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2020-10-20 06:46:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:49,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 219 transitions. [2020-10-20 06:46:49,660 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 71 [2020-10-20 06:46:49,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 149 states and 211 transitions. [2020-10-20 06:46:49,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2020-10-20 06:46:49,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2020-10-20 06:46:49,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 211 transitions. [2020-10-20 06:46:49,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:49,662 INFO L691 BuchiCegarLoop]: Abstraction has 149 states and 211 transitions. [2020-10-20 06:46:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 211 transitions. [2020-10-20 06:46:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2020-10-20 06:46:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-20 06:46:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 209 transitions. [2020-10-20 06:46:49,667 INFO L714 BuchiCegarLoop]: Abstraction has 147 states and 209 transitions. [2020-10-20 06:46:49,667 INFO L594 BuchiCegarLoop]: Abstraction has 147 states and 209 transitions. [2020-10-20 06:46:49,667 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:46:49,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 209 transitions. [2020-10-20 06:46:49,669 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2020-10-20 06:46:49,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:49,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:49,670 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:49,670 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:49,670 INFO L794 eck$LassoCheckResult]: Stem: 2041#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2004#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 2005#L178 assume !false; 2029#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2030#L31 assume 8466 == main_~s__state~0; 2009#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 2010#L80-1 main_~s__state~0 := 8496; 2118#L178 assume !false; 2116#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2105#L31 assume !(8466 == main_~s__state~0); 2104#L34 assume 8496 == main_~s__state~0; 2026#L35 assume !(1 == main_~blastFlag~0); 2019#L87-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 2020#L178 assume !false; 2108#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2106#L31 assume !(8466 == main_~s__state~0); 2023#L34 assume !(8496 == main_~s__state~0); 2024#L38 assume !(8512 == main_~s__state~0); 2052#L42 assume !(8528 == main_~s__state~0); 2039#L46 [2020-10-20 06:46:49,670 INFO L796 eck$LassoCheckResult]: Loop: 2039#L46 assume 8544 == main_~s__state~0; 1986#L47 assume !(0 != 1 + main_~s__verify_mode~0);main_~s__state~0 := 8560; 1987#L178 assume !false; 2051#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2049#L31 assume !(8466 == main_~s__state~0); 2047#L34 assume !(8496 == main_~s__state~0); 2045#L38 assume !(8512 == main_~s__state~0); 2044#L42 assume !(8528 == main_~s__state~0); 2039#L46 [2020-10-20 06:46:49,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash 495468714, now seen corresponding path program 1 times [2020-10-20 06:46:49,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:49,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384829795] [2020-10-20 06:46:49,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:49,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384829795] [2020-10-20 06:46:49,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:49,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:49,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016383457] [2020-10-20 06:46:49,710 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:49,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1040610643, now seen corresponding path program 1 times [2020-10-20 06:46:49,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:49,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260502283] [2020-10-20 06:46:49,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:49,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:49,718 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:49,720 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:49,747 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:49,747 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:49,748 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:49,748 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:49,748 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:46:49,748 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:49,748 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:49,748 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:49,748 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration5_Loop [2020-10-20 06:46:49,748 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:49,748 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:49,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:49,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:49,788 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:49,788 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:49,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:49,792 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:46:49,796 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:46:49,797 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__verify_mode~0=-1} Honda state: {ULTIMATE.start_main_~s__verify_mode~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:49,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:49,859 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:49,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:46:49,901 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:49,906 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:46:49,930 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:49,930 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:49,930 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:49,930 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:49,930 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:46:49,930 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:49,931 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:49,931 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:49,931 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration5_Loop [2020-10-20 06:46:49,931 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:49,931 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:49,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:49,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:49,964 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:49,964 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:49,972 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-10-20 06:46:49,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:49,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:49,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:49,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:49,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:49,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:49,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:49,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:50,016 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-10-20 06:46:50,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:50,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:50,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:50,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:50,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:50,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:50,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:50,022 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:46:50,026 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:46:50,026 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:50,035 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:46:50,035 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:46:50,035 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:46:50,035 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8552 Supporting invariants [] Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:50,068 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:46:50,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:50,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:50,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:50,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:50,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:50,164 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:46:50,164 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 209 transitions. cyclomatic complexity: 68 Second operand 4 states. [2020-10-20 06:46:50,384 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 209 transitions. cyclomatic complexity: 68. Second operand 4 states. Result 314 states and 460 transitions. Complement of second has 9 states. [2020-10-20 06:46:50,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:46:50,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:46:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2020-10-20 06:46:50,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 142 transitions. Stem has 19 letters. Loop has 8 letters. [2020-10-20 06:46:50,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:50,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 142 transitions. Stem has 27 letters. Loop has 8 letters. [2020-10-20 06:46:50,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:50,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 142 transitions. Stem has 19 letters. Loop has 16 letters. [2020-10-20 06:46:50,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:50,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 314 states and 460 transitions. [2020-10-20 06:46:50,390 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2020-10-20 06:46:50,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 314 states to 272 states and 402 transitions. [2020-10-20 06:46:50,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2020-10-20 06:46:50,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2020-10-20 06:46:50,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 272 states and 402 transitions. [2020-10-20 06:46:50,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:50,398 INFO L691 BuchiCegarLoop]: Abstraction has 272 states and 402 transitions. [2020-10-20 06:46:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states and 402 transitions. [2020-10-20 06:46:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 200. [2020-10-20 06:46:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-20 06:46:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 290 transitions. [2020-10-20 06:46:50,404 INFO L714 BuchiCegarLoop]: Abstraction has 200 states and 290 transitions. [2020-10-20 06:46:50,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:50,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:50,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:50,405 INFO L87 Difference]: Start difference. First operand 200 states and 290 transitions. Second operand 3 states. [2020-10-20 06:46:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:50,423 INFO L93 Difference]: Finished difference Result 248 states and 338 transitions. [2020-10-20 06:46:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:50,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 338 transitions. [2020-10-20 06:46:50,426 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 110 [2020-10-20 06:46:50,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 248 states and 338 transitions. [2020-10-20 06:46:50,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2020-10-20 06:46:50,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2020-10-20 06:46:50,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 248 states and 338 transitions. [2020-10-20 06:46:50,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:50,429 INFO L691 BuchiCegarLoop]: Abstraction has 248 states and 338 transitions. [2020-10-20 06:46:50,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states and 338 transitions. [2020-10-20 06:46:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2020-10-20 06:46:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-20 06:46:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 338 transitions. [2020-10-20 06:46:50,446 INFO L714 BuchiCegarLoop]: Abstraction has 248 states and 338 transitions. [2020-10-20 06:46:50,446 INFO L594 BuchiCegarLoop]: Abstraction has 248 states and 338 transitions. [2020-10-20 06:46:50,446 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:46:50,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 338 transitions. [2020-10-20 06:46:50,448 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 110 [2020-10-20 06:46:50,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:50,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:50,449 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:50,449 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:50,449 INFO L794 eck$LassoCheckResult]: Stem: 3067#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3027#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 3028#L178 assume !false; 3177#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3175#L31 assume 8466 == main_~s__state~0; 3173#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 3172#L80-1 main_~s__state~0 := 8496; 3171#L178 assume !false; 3168#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3165#L31 assume !(8466 == main_~s__state~0); 3163#L34 assume 8496 == main_~s__state~0; 3157#L35 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 3155#L87-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 3152#L178 assume !false; 3150#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3149#L31 assume !(8466 == main_~s__state~0); 3148#L34 assume !(8496 == main_~s__state~0); 3147#L38 assume !(8512 == main_~s__state~0); 3108#L42 assume !(8528 == main_~s__state~0); 3074#L46 assume !(8544 == main_~s__state~0); 3061#L50 [2020-10-20 06:46:50,450 INFO L796 eck$LassoCheckResult]: Loop: 3061#L50 assume 8560 == main_~s__state~0; 3022#L51 main_~s__state~0 := 8576; 3005#L178 assume !false; 3088#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3084#L31 assume !(8466 == main_~s__state~0); 3080#L34 assume !(8496 == main_~s__state~0); 3075#L38 assume !(8512 == main_~s__state~0); 3072#L42 assume !(8528 == main_~s__state~0); 3071#L46 assume !(8544 == main_~s__state~0); 3061#L50 [2020-10-20 06:46:50,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:50,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1794569917, now seen corresponding path program 1 times [2020-10-20 06:46:50,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:50,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717134746] [2020-10-20 06:46:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:50,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:50,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:50,476 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:50,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:50,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1708032834, now seen corresponding path program 1 times [2020-10-20 06:46:50,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:50,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721684409] [2020-10-20 06:46:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:50,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:50,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:50,484 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:50,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:50,485 INFO L82 PathProgramCache]: Analyzing trace with hash 480139650, now seen corresponding path program 1 times [2020-10-20 06:46:50,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:50,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146924258] [2020-10-20 06:46:50,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 06:46:50,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146924258] [2020-10-20 06:46:50,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:50,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:50,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878816705] [2020-10-20 06:46:50,559 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:50,559 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:50,559 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:50,560 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:50,560 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:46:50,560 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:50,560 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:50,560 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:50,560 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration6_Loop [2020-10-20 06:46:50,560 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:50,561 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:50,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:50,583 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:50,583 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 06:46:50,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:50,587 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:50,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:46:50,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:46:50,617 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:46:50,637 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:50,637 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:50,637 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:50,638 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:50,638 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:46:50,638 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:50,638 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:50,638 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:50,638 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration6_Loop [2020-10-20 06:46:50,638 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:50,638 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:50,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:50,664 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:50,664 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:50,667 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-10-20 06:46:50,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:50,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:50,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:50,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:50,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:50,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:50,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:50,675 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:46:50,682 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:46:50,682 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:50,688 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:46:50,688 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:46:50,688 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:46:50,688 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8568 Supporting invariants [] Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:50,711 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:46:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:50,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:50,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:50,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:50,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:50,787 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:46:50,787 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 248 states and 338 transitions. cyclomatic complexity: 98 Second operand 4 states. [2020-10-20 06:46:51,051 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 248 states and 338 transitions. cyclomatic complexity: 98. Second operand 4 states. Result 440 states and 627 transitions. Complement of second has 9 states. [2020-10-20 06:46:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:46:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:46:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2020-10-20 06:46:51,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 167 transitions. Stem has 20 letters. Loop has 9 letters. [2020-10-20 06:46:51,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:51,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 167 transitions. Stem has 29 letters. Loop has 9 letters. [2020-10-20 06:46:51,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:51,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 167 transitions. Stem has 20 letters. Loop has 18 letters. [2020-10-20 06:46:51,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:51,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 440 states and 627 transitions. [2020-10-20 06:46:51,058 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 157 [2020-10-20 06:46:51,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 440 states to 405 states and 577 transitions. [2020-10-20 06:46:51,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2020-10-20 06:46:51,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2020-10-20 06:46:51,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 405 states and 577 transitions. [2020-10-20 06:46:51,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:51,064 INFO L691 BuchiCegarLoop]: Abstraction has 405 states and 577 transitions. [2020-10-20 06:46:51,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states and 577 transitions. [2020-10-20 06:46:51,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 323. [2020-10-20 06:46:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-10-20 06:46:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 448 transitions. [2020-10-20 06:46:51,072 INFO L714 BuchiCegarLoop]: Abstraction has 323 states and 448 transitions. [2020-10-20 06:46:51,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:51,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:51,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:51,074 INFO L87 Difference]: Start difference. First operand 323 states and 448 transitions. Second operand 3 states. [2020-10-20 06:46:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:51,156 INFO L93 Difference]: Finished difference Result 396 states and 522 transitions. [2020-10-20 06:46:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:51,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 396 states and 522 transitions. [2020-10-20 06:46:51,160 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 152 [2020-10-20 06:46:51,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 396 states to 371 states and 497 transitions. [2020-10-20 06:46:51,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2020-10-20 06:46:51,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2020-10-20 06:46:51,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 497 transitions. [2020-10-20 06:46:51,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:51,164 INFO L691 BuchiCegarLoop]: Abstraction has 371 states and 497 transitions. [2020-10-20 06:46:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 497 transitions. [2020-10-20 06:46:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 335. [2020-10-20 06:46:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-10-20 06:46:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 460 transitions. [2020-10-20 06:46:51,172 INFO L714 BuchiCegarLoop]: Abstraction has 335 states and 460 transitions. [2020-10-20 06:46:51,172 INFO L594 BuchiCegarLoop]: Abstraction has 335 states and 460 transitions. [2020-10-20 06:46:51,172 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:46:51,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 335 states and 460 transitions. [2020-10-20 06:46:51,175 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 150 [2020-10-20 06:46:51,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:51,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:51,176 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:51,176 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:51,177 INFO L794 eck$LassoCheckResult]: Stem: 4599#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4551#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 4552#L178 assume !false; 4796#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 4794#L31 assume 8466 == main_~s__state~0; 4793#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 4791#L80-1 main_~s__state~0 := 8496; 4789#L178 assume !false; 4785#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 4784#L31 assume !(8466 == main_~s__state~0); 4783#L34 assume 8496 == main_~s__state~0; 4578#L35 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 4572#L87-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 4574#L178 [2020-10-20 06:46:51,177 INFO L796 eck$LassoCheckResult]: Loop: 4574#L178 assume !false; 4581#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 4582#L31 assume !(8466 == main_~s__state~0); 4576#L34 assume !(8496 == main_~s__state~0); 4540#L38 assume !(8512 == main_~s__state~0); 4541#L42 assume !(8528 == main_~s__state~0); 4597#L46 assume !(8544 == main_~s__state~0); 4604#L50 assume !(8560 == main_~s__state~0); 4575#L54 assume !(8576 == main_~s__state~0); 4534#L58 assume !(8592 == main_~s__state~0); 4535#L62 assume !(8608 == main_~s__state~0); 4548#L66 assume !(8640 == main_~s__state~0); 4586#L70 assume 8656 == main_~s__state~0; 4544#L71 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 4545#L164-1 main_~s__state~0 := 8672; 4574#L178 [2020-10-20 06:46:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2108014467, now seen corresponding path program 1 times [2020-10-20 06:46:51,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:51,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934722538] [2020-10-20 06:46:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:51,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:51,196 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:51,200 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:51,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:51,200 INFO L82 PathProgramCache]: Analyzing trace with hash -318790614, now seen corresponding path program 1 times [2020-10-20 06:46:51,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:51,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162151775] [2020-10-20 06:46:51,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:51,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:51,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:51,215 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:51,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:51,216 INFO L82 PathProgramCache]: Analyzing trace with hash -444277714, now seen corresponding path program 1 times [2020-10-20 06:46:51,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:51,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855988436] [2020-10-20 06:46:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:51,235 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:51,258 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:51,265 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:51,312 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:51,312 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:51,312 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:51,312 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:51,312 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:46:51,312 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:51,313 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:51,313 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:51,313 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration7_Loop [2020-10-20 06:46:51,313 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:51,313 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:51,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:51,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:51,358 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:51,358 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:51,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:51,362 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:51,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:46:51,390 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:51,395 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:46:51,433 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:51,433 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:51,433 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:51,433 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:51,433 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:46:51,434 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:51,434 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:51,434 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:51,434 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration7_Loop [2020-10-20 06:46:51,434 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:51,434 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:51,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:51,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:51,473 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:51,473 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:51,476 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-10-20 06:46:51,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:51,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:51,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:51,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:51,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:51,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:51,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:51,482 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:46:51,489 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:46:51,489 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:51,491 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:51,491 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:46:51,501 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:46:51,501 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~blastFlag~0) = -2*ULTIMATE.start_main_~blastFlag~0 + 5 Supporting invariants [] [2020-10-20 06:46:51,534 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:46:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:51,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:51,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:51,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:51,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:51,588 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-10-20 06:46:51,588 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 335 states and 460 transitions. cyclomatic complexity: 135 Second operand 4 states. [2020-10-20 06:46:51,615 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 335 states and 460 transitions. cyclomatic complexity: 135. Second operand 4 states. Result 466 states and 639 transitions. Complement of second has 4 states. [2020-10-20 06:46:51,616 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-10-20 06:46:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:46:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2020-10-20 06:46:51,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 129 transitions. Stem has 13 letters. Loop has 15 letters. [2020-10-20 06:46:51,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:51,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 129 transitions. Stem has 28 letters. Loop has 15 letters. [2020-10-20 06:46:51,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:51,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 129 transitions. Stem has 13 letters. Loop has 30 letters. [2020-10-20 06:46:51,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:51,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 466 states and 639 transitions. [2020-10-20 06:46:51,621 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 207 [2020-10-20 06:46:51,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 466 states to 461 states and 634 transitions. [2020-10-20 06:46:51,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2020-10-20 06:46:51,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 251 [2020-10-20 06:46:51,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 634 transitions. [2020-10-20 06:46:51,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:51,626 INFO L691 BuchiCegarLoop]: Abstraction has 461 states and 634 transitions. [2020-10-20 06:46:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 634 transitions. [2020-10-20 06:46:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 458. [2020-10-20 06:46:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-10-20 06:46:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 631 transitions. [2020-10-20 06:46:51,634 INFO L714 BuchiCegarLoop]: Abstraction has 458 states and 631 transitions. [2020-10-20 06:46:51,634 INFO L594 BuchiCegarLoop]: Abstraction has 458 states and 631 transitions. [2020-10-20 06:46:51,634 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:46:51,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 458 states and 631 transitions. [2020-10-20 06:46:51,637 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 207 [2020-10-20 06:46:51,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:51,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:51,638 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:51,638 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:51,638 INFO L794 eck$LassoCheckResult]: Stem: 5528#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 5469#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 5470#L178 assume !false; 5783#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5781#L31 assume 8466 == main_~s__state~0; 5779#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 5778#L80-1 main_~s__state~0 := 8496; 5776#L178 assume !false; 5774#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5771#L31 assume !(8466 == main_~s__state~0); 5751#L34 assume 8496 == main_~s__state~0; 5747#L35 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 5728#L87-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 5492#L178 assume !false; 5515#L25 [2020-10-20 06:46:51,638 INFO L796 eck$LassoCheckResult]: Loop: 5515#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5813#L31 assume !(8466 == main_~s__state~0); 5812#L34 assume !(8496 == main_~s__state~0); 5811#L38 assume !(8512 == main_~s__state~0); 5810#L42 assume !(8528 == main_~s__state~0); 5809#L46 assume !(8544 == main_~s__state~0); 5808#L50 assume !(8560 == main_~s__state~0); 5805#L54 assume !(8576 == main_~s__state~0); 5802#L58 assume !(8592 == main_~s__state~0); 5459#L62 assume !(8608 == main_~s__state~0); 5460#L66 assume !(8640 == main_~s__state~0); 5533#L70 assume 8656 == main_~s__state~0; 5637#L71 assume !(2 == main_~blastFlag~0); 5505#L164-1 main_~s__state~0 := 8672; 5500#L178 assume !false; 5515#L25 [2020-10-20 06:46:51,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:51,639 INFO L82 PathProgramCache]: Analyzing trace with hash -923939026, now seen corresponding path program 2 times [2020-10-20 06:46:51,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:51,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526281747] [2020-10-20 06:46:51,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:51,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:51,653 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:51,656 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:51,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:51,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1835507732, now seen corresponding path program 1 times [2020-10-20 06:46:51,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:51,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442780278] [2020-10-20 06:46:51,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:51,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:51,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:51,664 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:51,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:51,665 INFO L82 PathProgramCache]: Analyzing trace with hash -887705313, now seen corresponding path program 1 times [2020-10-20 06:46:51,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:51,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535224206] [2020-10-20 06:46:51,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 06:46:51,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535224206] [2020-10-20 06:46:51,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:51,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:51,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756969123] [2020-10-20 06:46:51,720 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:51,720 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:51,720 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:51,720 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:51,720 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:46:51,720 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:51,720 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:51,721 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:51,721 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration8_Loop [2020-10-20 06:46:51,721 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:51,721 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:51,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:51,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:51,751 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:51,751 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:51,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:51,755 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:51,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:46:51,793 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:51,798 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:46:51,838 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:51,838 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:51,838 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:51,838 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:51,838 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:46:51,838 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:51,839 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:51,839 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:51,839 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration8_Loop [2020-10-20 06:46:51,839 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:51,839 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:51,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:51,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:51,910 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:51,910 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:51,920 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-10-20 06:46:51,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:51,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:51,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:51,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:51,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:51,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:51,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:51,925 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:46:51,927 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:46:51,928 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:51,930 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:46:51,930 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:46:51,930 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:46:51,931 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8664 Supporting invariants [] Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:51,960 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:46:51,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:51,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:51,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:51,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:51,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:52,010 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:46:52,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 458 states and 631 transitions. cyclomatic complexity: 185 Second operand 5 states. [2020-10-20 06:46:52,157 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 458 states and 631 transitions. cyclomatic complexity: 185. Second operand 5 states. Result 1022 states and 1366 transitions. Complement of second has 9 states. [2020-10-20 06:46:52,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:46:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:46:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2020-10-20 06:46:52,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 14 letters. Loop has 15 letters. [2020-10-20 06:46:52,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:52,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 29 letters. Loop has 15 letters. [2020-10-20 06:46:52,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:52,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 14 letters. Loop has 30 letters. [2020-10-20 06:46:52,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:52,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1022 states and 1366 transitions. [2020-10-20 06:46:52,170 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 248 [2020-10-20 06:46:52,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1022 states to 870 states and 1159 transitions. [2020-10-20 06:46:52,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2020-10-20 06:46:52,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 330 [2020-10-20 06:46:52,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 870 states and 1159 transitions. [2020-10-20 06:46:52,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:52,177 INFO L691 BuchiCegarLoop]: Abstraction has 870 states and 1159 transitions. [2020-10-20 06:46:52,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states and 1159 transitions. [2020-10-20 06:46:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 835. [2020-10-20 06:46:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2020-10-20 06:46:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1113 transitions. [2020-10-20 06:46:52,212 INFO L714 BuchiCegarLoop]: Abstraction has 835 states and 1113 transitions. [2020-10-20 06:46:52,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:52,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:52,216 INFO L87 Difference]: Start difference. First operand 835 states and 1113 transitions. Second operand 3 states. [2020-10-20 06:46:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:52,270 INFO L93 Difference]: Finished difference Result 918 states and 1216 transitions. [2020-10-20 06:46:52,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:52,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 918 states and 1216 transitions. [2020-10-20 06:46:52,276 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 329 [2020-10-20 06:46:52,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 918 states to 916 states and 1214 transitions. [2020-10-20 06:46:52,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 395 [2020-10-20 06:46:52,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 407 [2020-10-20 06:46:52,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 916 states and 1214 transitions. [2020-10-20 06:46:52,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:52,284 INFO L691 BuchiCegarLoop]: Abstraction has 916 states and 1214 transitions. [2020-10-20 06:46:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states and 1214 transitions. [2020-10-20 06:46:52,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 904. [2020-10-20 06:46:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2020-10-20 06:46:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1202 transitions. [2020-10-20 06:46:52,299 INFO L714 BuchiCegarLoop]: Abstraction has 904 states and 1202 transitions. [2020-10-20 06:46:52,299 INFO L594 BuchiCegarLoop]: Abstraction has 904 states and 1202 transitions. [2020-10-20 06:46:52,299 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:46:52,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 904 states and 1202 transitions. [2020-10-20 06:46:52,304 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 329 [2020-10-20 06:46:52,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:52,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:52,306 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:52,306 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:52,306 INFO L794 eck$LassoCheckResult]: Stem: 8877#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8815#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 8816#L178 assume !false; 9531#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 9532#L31 assume 8466 == main_~s__state~0; 9669#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 9668#L80-1 main_~s__state~0 := 8496; 9667#L178 assume !false; 9666#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 9665#L31 assume !(8466 == main_~s__state~0); 9664#L34 assume 8496 == main_~s__state~0; 9663#L35 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 9283#L87-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 9281#L178 assume !false; 8855#L25 [2020-10-20 06:46:52,306 INFO L796 eck$LassoCheckResult]: Loop: 8855#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 8856#L31 assume !(8466 == main_~s__state~0); 8843#L34 assume !(8496 == main_~s__state~0); 8796#L38 assume !(8512 == main_~s__state~0); 8797#L42 assume !(8528 == main_~s__state~0); 8874#L46 assume !(8544 == main_~s__state~0); 8868#L50 assume !(8560 == main_~s__state~0); 8841#L54 assume !(8576 == main_~s__state~0); 8792#L58 assume !(8592 == main_~s__state~0); 8793#L62 assume !(8608 == main_~s__state~0); 8807#L66 assume !(8640 == main_~s__state~0); 8861#L70 assume !(8656 == main_~s__state~0); 8821#L74 assume 8672 == main_~s__state~0; 8822#L75 assume !(4 == main_~blastFlag~0); 8878#L174 assume !(5 == main_~blastFlag~0); 8889#L171-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 9127#L178 assume !false; 9124#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 9120#L31 assume !(8466 == main_~s__state~0); 9116#L34 assume 8496 == main_~s__state~0; 9117#L35 assume !(1 == main_~blastFlag~0); 9131#L87-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 8847#L178 assume !false; 8855#L25 [2020-10-20 06:46:52,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:52,307 INFO L82 PathProgramCache]: Analyzing trace with hash -923939026, now seen corresponding path program 3 times [2020-10-20 06:46:52,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:52,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909402687] [2020-10-20 06:46:52,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:52,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:52,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:52,324 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:52,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1607513209, now seen corresponding path program 1 times [2020-10-20 06:46:52,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:52,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054547866] [2020-10-20 06:46:52,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:52,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054547866] [2020-10-20 06:46:52,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:52,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:52,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871224818] [2020-10-20 06:46:52,340 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:46:52,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:52,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:52,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:52,341 INFO L87 Difference]: Start difference. First operand 904 states and 1202 transitions. cyclomatic complexity: 321 Second operand 3 states. [2020-10-20 06:46:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:52,414 INFO L93 Difference]: Finished difference Result 770 states and 964 transitions. [2020-10-20 06:46:52,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:52,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 770 states and 964 transitions. [2020-10-20 06:46:52,420 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 224 [2020-10-20 06:46:52,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 770 states to 757 states and 951 transitions. [2020-10-20 06:46:52,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2020-10-20 06:46:52,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2020-10-20 06:46:52,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 757 states and 951 transitions. [2020-10-20 06:46:52,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:52,426 INFO L691 BuchiCegarLoop]: Abstraction has 757 states and 951 transitions. [2020-10-20 06:46:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states and 951 transitions. [2020-10-20 06:46:52,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 754. [2020-10-20 06:46:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2020-10-20 06:46:52,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 946 transitions. [2020-10-20 06:46:52,439 INFO L714 BuchiCegarLoop]: Abstraction has 754 states and 946 transitions. [2020-10-20 06:46:52,439 INFO L594 BuchiCegarLoop]: Abstraction has 754 states and 946 transitions. [2020-10-20 06:46:52,439 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:46:52,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 946 transitions. [2020-10-20 06:46:52,443 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 224 [2020-10-20 06:46:52,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:52,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:52,444 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:52,445 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:52,445 INFO L794 eck$LassoCheckResult]: Stem: 10557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10493#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 10494#L178 assume !false; 10787#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10788#L31 assume 8466 == main_~s__state~0; 11193#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 11192#L80-1 main_~s__state~0 := 8496; 11191#L178 assume !false; 11190#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11189#L31 assume !(8466 == main_~s__state~0); 11188#L34 assume 8496 == main_~s__state~0; 11187#L35 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 10519#L87-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 10521#L178 assume !false; 10914#L25 [2020-10-20 06:46:52,445 INFO L796 eck$LassoCheckResult]: Loop: 10914#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11071#L31 assume !(8466 == main_~s__state~0); 11070#L34 assume !(8496 == main_~s__state~0); 11069#L38 assume !(8512 == main_~s__state~0); 11068#L42 assume !(8528 == main_~s__state~0); 11067#L46 assume !(8544 == main_~s__state~0); 11066#L50 assume !(8560 == main_~s__state~0); 11065#L54 assume !(8576 == main_~s__state~0); 11064#L58 assume !(8592 == main_~s__state~0); 11063#L62 assume !(8608 == main_~s__state~0); 10563#L66 assume !(8640 == main_~s__state~0); 10541#L70 assume !(8656 == main_~s__state~0); 10497#L74 assume 8672 == main_~s__state~0; 10498#L75 assume !(4 == main_~blastFlag~0); 10558#L174 assume !(5 == main_~blastFlag~0); 10501#L171-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 10502#L178 assume !false; 11083#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11082#L31 assume !(8466 == main_~s__state~0); 11081#L34 assume !(8496 == main_~s__state~0); 11080#L38 assume !(8512 == main_~s__state~0); 11079#L42 assume !(8528 == main_~s__state~0); 11078#L46 assume !(8544 == main_~s__state~0); 11077#L50 assume !(8560 == main_~s__state~0); 11075#L54 assume !(8576 == main_~s__state~0); 11073#L58 assume !(8592 == main_~s__state~0); 11072#L62 assume !(8608 == main_~s__state~0); 10859#L66 assume 8640 == main_~s__state~0; 10860#L67 assume !(3 == main_~blastFlag~0); 11076#L153-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8656; 11074#L178 assume !false; 10914#L25 [2020-10-20 06:46:52,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:52,445 INFO L82 PathProgramCache]: Analyzing trace with hash -923939026, now seen corresponding path program 4 times [2020-10-20 06:46:52,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:52,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345457086] [2020-10-20 06:46:52,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:52,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:52,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:52,461 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:52,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:52,461 INFO L82 PathProgramCache]: Analyzing trace with hash 530770115, now seen corresponding path program 1 times [2020-10-20 06:46:52,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:52,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721045424] [2020-10-20 06:46:52,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:52,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721045424] [2020-10-20 06:46:52,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:52,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:52,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800077741] [2020-10-20 06:46:52,497 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:46:52,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:52,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:52,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:52,498 INFO L87 Difference]: Start difference. First operand 754 states and 946 transitions. cyclomatic complexity: 217 Second operand 3 states. [2020-10-20 06:46:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:52,516 INFO L93 Difference]: Finished difference Result 737 states and 924 transitions. [2020-10-20 06:46:52,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:52,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 737 states and 924 transitions. [2020-10-20 06:46:52,520 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 192 [2020-10-20 06:46:52,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 737 states to 725 states and 909 transitions. [2020-10-20 06:46:52,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 276 [2020-10-20 06:46:52,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 276 [2020-10-20 06:46:52,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 725 states and 909 transitions. [2020-10-20 06:46:52,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:52,525 INFO L691 BuchiCegarLoop]: Abstraction has 725 states and 909 transitions. [2020-10-20 06:46:52,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states and 909 transitions. [2020-10-20 06:46:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 670. [2020-10-20 06:46:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2020-10-20 06:46:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 853 transitions. [2020-10-20 06:46:52,536 INFO L714 BuchiCegarLoop]: Abstraction has 670 states and 853 transitions. [2020-10-20 06:46:52,536 INFO L594 BuchiCegarLoop]: Abstraction has 670 states and 853 transitions. [2020-10-20 06:46:52,536 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:46:52,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 670 states and 853 transitions. [2020-10-20 06:46:52,539 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 168 [2020-10-20 06:46:52,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:52,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:52,540 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:52,540 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:52,540 INFO L794 eck$LassoCheckResult]: Stem: 12048#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 11992#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 11993#L178 assume !false; 12431#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12432#L31 assume 8466 == main_~s__state~0; 12611#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 12610#L80-1 main_~s__state~0 := 8496; 12609#L178 assume !false; 12607#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12606#L31 assume !(8466 == main_~s__state~0); 12605#L34 assume 8496 == main_~s__state~0; 12603#L35 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 12600#L87-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 12342#L178 assume !false; 12026#L25 [2020-10-20 06:46:52,541 INFO L796 eck$LassoCheckResult]: Loop: 12026#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12027#L31 assume !(8466 == main_~s__state~0); 12044#L34 assume !(8496 == main_~s__state~0); 11973#L38 assume !(8512 == main_~s__state~0); 11974#L42 assume !(8528 == main_~s__state~0); 12045#L46 assume !(8544 == main_~s__state~0); 12040#L50 assume !(8560 == main_~s__state~0); 12012#L54 assume !(8576 == main_~s__state~0); 11966#L58 assume !(8592 == main_~s__state~0); 11967#L62 assume !(8608 == main_~s__state~0); 11984#L66 assume !(8640 == main_~s__state~0); 12032#L70 assume !(8656 == main_~s__state~0); 11994#L74 assume 8672 == main_~s__state~0; 11995#L75 assume !(4 == main_~blastFlag~0); 12049#L174 assume !(5 == main_~blastFlag~0); 12433#L171-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 12573#L178 assume !false; 12026#L25 [2020-10-20 06:46:52,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:52,541 INFO L82 PathProgramCache]: Analyzing trace with hash -923939026, now seen corresponding path program 5 times [2020-10-20 06:46:52,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:52,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101223064] [2020-10-20 06:46:52,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:52,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:52,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:52,555 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:52,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:52,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1282190981, now seen corresponding path program 1 times [2020-10-20 06:46:52,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:52,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558729051] [2020-10-20 06:46:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:52,559 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:52,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:52,563 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:52,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1587248888, now seen corresponding path program 1 times [2020-10-20 06:46:52,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:52,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534903246] [2020-10-20 06:46:52,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 06:46:52,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534903246] [2020-10-20 06:46:52,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:52,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:52,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817939030] [2020-10-20 06:46:52,624 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:52,625 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:52,625 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:52,625 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:52,625 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:46:52,625 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:52,625 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:52,625 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:52,625 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration11_Loop [2020-10-20 06:46:52,625 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:52,625 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:52,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:52,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:52,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:52,698 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:52,698 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:52,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:52,702 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:52,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:46:52,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:46:52,730 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:46:52,752 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:52,752 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:52,752 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:52,752 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:52,752 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:46:52,752 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:52,752 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:52,752 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:52,752 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration11_Loop [2020-10-20 06:46:52,753 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:52,753 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:52,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:52,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:52,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:52,838 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:52,838 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:52,841 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-10-20 06:46:52,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:52,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:52,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:52,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:52,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:52,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:52,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:52,848 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:46:52,850 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-20 06:46:52,850 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:52,857 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:46:52,857 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:46:52,857 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:46:52,857 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = 1*ULTIMATE.start_main_~s__state~0 Supporting invariants [] [2020-10-20 06:46:52,877 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:46:52,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:52,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:52,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:52,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:52,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:52,937 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:46:52,938 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 670 states and 853 transitions. cyclomatic complexity: 208 Second operand 5 states. [2020-10-20 06:46:52,948 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 670 states and 853 transitions. cyclomatic complexity: 208. Second operand 5 states. Result 676 states and 859 transitions. Complement of second has 5 states. [2020-10-20 06:46:52,949 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-10-20 06:46:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:46:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-10-20 06:46:52,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 14 letters. Loop has 17 letters. [2020-10-20 06:46:52,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:52,950 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:46:52,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:52,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:52,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:52,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:52,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:53,007 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:46:53,007 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 670 states and 853 transitions. cyclomatic complexity: 208 Second operand 5 states. [2020-10-20 06:46:53,018 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 670 states and 853 transitions. cyclomatic complexity: 208. Second operand 5 states. Result 676 states and 859 transitions. Complement of second has 5 states. [2020-10-20 06:46:53,018 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-10-20 06:46:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:46:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-10-20 06:46:53,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 14 letters. Loop has 17 letters. [2020-10-20 06:46:53,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:53,019 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:46:53,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:53,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:53,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:53,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:53,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:53,071 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 3 loop predicates [2020-10-20 06:46:53,071 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 670 states and 853 transitions. cyclomatic complexity: 208 Second operand 5 states. [2020-10-20 06:46:53,211 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 670 states and 853 transitions. cyclomatic complexity: 208. Second operand 5 states. Result 1242 states and 1551 transitions. Complement of second has 8 states. [2020-10-20 06:46:53,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:46:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:46:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2020-10-20 06:46:53,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 14 letters. Loop has 17 letters. [2020-10-20 06:46:53,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:53,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 31 letters. Loop has 17 letters. [2020-10-20 06:46:53,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:53,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 14 letters. Loop has 34 letters. [2020-10-20 06:46:53,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:53,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1242 states and 1551 transitions. [2020-10-20 06:46:53,221 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 164 [2020-10-20 06:46:53,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1242 states to 801 states and 997 transitions. [2020-10-20 06:46:53,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2020-10-20 06:46:53,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2020-10-20 06:46:53,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 801 states and 997 transitions. [2020-10-20 06:46:53,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:53,227 INFO L691 BuchiCegarLoop]: Abstraction has 801 states and 997 transitions. [2020-10-20 06:46:53,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states and 997 transitions. [2020-10-20 06:46:53,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 697. [2020-10-20 06:46:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2020-10-20 06:46:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 893 transitions. [2020-10-20 06:46:53,242 INFO L714 BuchiCegarLoop]: Abstraction has 697 states and 893 transitions. [2020-10-20 06:46:53,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:53,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:53,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:53,243 INFO L87 Difference]: Start difference. First operand 697 states and 893 transitions. Second operand 3 states. [2020-10-20 06:46:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:53,309 INFO L93 Difference]: Finished difference Result 690 states and 883 transitions. [2020-10-20 06:46:53,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:53,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 690 states and 883 transitions. [2020-10-20 06:46:53,314 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 162 [2020-10-20 06:46:53,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 690 states to 668 states and 861 transitions. [2020-10-20 06:46:53,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2020-10-20 06:46:53,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2020-10-20 06:46:53,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 668 states and 861 transitions. [2020-10-20 06:46:53,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:53,319 INFO L691 BuchiCegarLoop]: Abstraction has 668 states and 861 transitions. [2020-10-20 06:46:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states and 861 transitions. [2020-10-20 06:46:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 667. [2020-10-20 06:46:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2020-10-20 06:46:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 860 transitions. [2020-10-20 06:46:53,330 INFO L714 BuchiCegarLoop]: Abstraction has 667 states and 860 transitions. [2020-10-20 06:46:53,330 INFO L594 BuchiCegarLoop]: Abstraction has 667 states and 860 transitions. [2020-10-20 06:46:53,330 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 06:46:53,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 667 states and 860 transitions. [2020-10-20 06:46:53,334 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 162 [2020-10-20 06:46:53,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:53,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:53,335 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:53,335 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:53,335 INFO L794 eck$LassoCheckResult]: Stem: 17029#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 16965#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 16966#L178 assume !false; 17394#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 17392#L31 assume 8466 == main_~s__state~0; 17390#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 17389#L80-1 main_~s__state~0 := 8496; 17388#L178 assume !false; 17387#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 17385#L31 assume !(8466 == main_~s__state~0); 17383#L34 assume 8496 == main_~s__state~0; 17380#L35 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 17378#L87-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 17373#L178 assume !false; 17370#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 17301#L31 assume !(8466 == main_~s__state~0); 17295#L34 assume !(8496 == main_~s__state~0); 17296#L38 assume !(8512 == main_~s__state~0); 17212#L42 assume !(8528 == main_~s__state~0); 17153#L46 assume !(8544 == main_~s__state~0); 17122#L50 assume !(8560 == main_~s__state~0); 17048#L54 [2020-10-20 06:46:53,335 INFO L796 eck$LassoCheckResult]: Loop: 17048#L54 assume 8576 == main_~s__state~0; 17032#L55 main_~tmp___1~0 := main_#t~nondet11;havoc main_#t~nondet11; 16959#L137 assume !(2 == main_~tmp___1~0);main_~s__state~0 := 8592; 16939#L178 assume !false; 17076#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 17071#L31 assume !(8466 == main_~s__state~0); 17065#L34 assume !(8496 == main_~s__state~0); 17060#L38 assume !(8512 == main_~s__state~0); 17054#L42 assume !(8528 == main_~s__state~0); 17046#L46 assume !(8544 == main_~s__state~0); 17047#L50 assume !(8560 == main_~s__state~0); 17048#L54 [2020-10-20 06:46:53,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:53,336 INFO L82 PathProgramCache]: Analyzing trace with hash 477150995, now seen corresponding path program 1 times [2020-10-20 06:46:53,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:53,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399884434] [2020-10-20 06:46:53,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 06:46:53,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399884434] [2020-10-20 06:46:53,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:53,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:53,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195767157] [2020-10-20 06:46:53,356 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:53,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:53,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1797154313, now seen corresponding path program 1 times [2020-10-20 06:46:53,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:53,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323232672] [2020-10-20 06:46:53,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:53,360 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:53,361 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:53,363 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:53,392 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:53,392 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:53,392 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:53,393 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:53,393 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:46:53,393 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:53,393 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:53,393 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:53,393 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration12_Loop [2020-10-20 06:46:53,393 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:53,393 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:53,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:53,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:53,442 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:53,442 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:53,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:53,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:46:53,451 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:46:53,451 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet11=7, ULTIMATE.start_main_~tmp___1~0=7} Honda state: {ULTIMATE.start_main_#t~nondet11=7, ULTIMATE.start_main_~tmp___1~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:53,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:53,482 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:53,506 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:46:53,506 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:46:53,510 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:46:53,530 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:53,531 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:53,531 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:53,531 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:53,531 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:46:53,531 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:53,531 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:53,531 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:53,531 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration12_Loop [2020-10-20 06:46:53,531 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:53,531 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:53,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:53,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:53,592 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:53,592 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:53,597 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-10-20 06:46:53,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:53,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:53,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:53,599 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:46:53,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:53,601 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:46:53,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:53,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:53,626 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 Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:53,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:53,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:53,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:53,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:53,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:53,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:53,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:53,631 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:46:53,633 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:46:53,633 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:53,636 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:46:53,637 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:46:53,637 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:46:53,637 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8584 Supporting invariants [] [2020-10-20 06:46:53,658 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:46:53,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:53,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:53,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:53,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:53,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:53,730 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:46:53,730 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 667 states and 860 transitions. cyclomatic complexity: 216 Second operand 4 states. [2020-10-20 06:46:53,955 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 667 states and 860 transitions. cyclomatic complexity: 216. Second operand 4 states. Result 1093 states and 1434 transitions. Complement of second has 9 states. [2020-10-20 06:46:53,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:46:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:46:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2020-10-20 06:46:53,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 162 transitions. Stem has 21 letters. Loop has 11 letters. [2020-10-20 06:46:53,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:53,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 162 transitions. Stem has 32 letters. Loop has 11 letters. [2020-10-20 06:46:53,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:53,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 162 transitions. Stem has 21 letters. Loop has 22 letters. [2020-10-20 06:46:53,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:53,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1093 states and 1434 transitions. [2020-10-20 06:46:53,966 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 215 [2020-10-20 06:46:53,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1093 states to 965 states and 1269 transitions. [2020-10-20 06:46:53,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 279 [2020-10-20 06:46:53,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 287 [2020-10-20 06:46:53,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 965 states and 1269 transitions. [2020-10-20 06:46:53,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:53,975 INFO L691 BuchiCegarLoop]: Abstraction has 965 states and 1269 transitions. [2020-10-20 06:46:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states and 1269 transitions. [2020-10-20 06:46:54,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 796. [2020-10-20 06:46:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-10-20 06:46:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1052 transitions. [2020-10-20 06:46:54,017 INFO L714 BuchiCegarLoop]: Abstraction has 796 states and 1052 transitions. [2020-10-20 06:46:54,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:54,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:54,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:54,019 INFO L87 Difference]: Start difference. First operand 796 states and 1052 transitions. Second operand 3 states. [2020-10-20 06:46:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:54,076 INFO L93 Difference]: Finished difference Result 861 states and 1107 transitions. [2020-10-20 06:46:54,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:54,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 861 states and 1107 transitions. [2020-10-20 06:46:54,082 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 207 [2020-10-20 06:46:54,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 861 states to 837 states and 1077 transitions. [2020-10-20 06:46:54,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 250 [2020-10-20 06:46:54,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253 [2020-10-20 06:46:54,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 837 states and 1077 transitions. [2020-10-20 06:46:54,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:54,092 INFO L691 BuchiCegarLoop]: Abstraction has 837 states and 1077 transitions. [2020-10-20 06:46:54,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states and 1077 transitions. [2020-10-20 06:46:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 829. [2020-10-20 06:46:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2020-10-20 06:46:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1068 transitions. [2020-10-20 06:46:54,111 INFO L714 BuchiCegarLoop]: Abstraction has 829 states and 1068 transitions. [2020-10-20 06:46:54,111 INFO L594 BuchiCegarLoop]: Abstraction has 829 states and 1068 transitions. [2020-10-20 06:46:54,111 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 06:46:54,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 829 states and 1068 transitions. [2020-10-20 06:46:54,116 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 206 [2020-10-20 06:46:54,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:54,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:54,117 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:54,118 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:54,118 INFO L794 eck$LassoCheckResult]: Stem: 20567#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 20506#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 20507#L178 assume !false; 20919#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20918#L31 assume 8466 == main_~s__state~0; 20917#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 20916#L80-1 main_~s__state~0 := 8496; 20915#L178 assume !false; 20914#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20913#L31 assume !(8466 == main_~s__state~0); 20912#L34 assume 8496 == main_~s__state~0; 20911#L35 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 20910#L87-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 20909#L178 assume !false; 20908#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20907#L31 assume !(8466 == main_~s__state~0); 20904#L34 assume !(8496 == main_~s__state~0); 20901#L38 assume 8512 == main_~s__state~0; 20844#L39 main_~s__state~0 := 8528; 20840#L178 assume !false; 20842#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20836#L31 assume !(8466 == main_~s__state~0); 20834#L34 assume !(8496 == main_~s__state~0); 20831#L38 assume !(8512 == main_~s__state~0); 20832#L42 assume !(8528 == main_~s__state~0); 20819#L46 assume !(8544 == main_~s__state~0); 20778#L50 assume !(8560 == main_~s__state~0); 20692#L54 assume 8576 == main_~s__state~0; 20569#L55 [2020-10-20 06:46:54,118 INFO L796 eck$LassoCheckResult]: Loop: 20569#L55 main_~tmp___1~0 := main_#t~nondet11;havoc main_#t~nondet11; 20501#L137 assume 2 == main_~tmp___1~0;main_~s__state~0 := 8466; 20502#L178 assume !false; 20741#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20739#L31 assume 8466 == main_~s__state~0; 20656#L32 assume !(0 == main_~blastFlag~0); 20736#L80-1 main_~s__state~0 := 8496; 20734#L178 assume !false; 20731#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20728#L31 assume !(8466 == main_~s__state~0); 20725#L34 assume 8496 == main_~s__state~0; 20654#L35 assume !(1 == main_~blastFlag~0); 20720#L87-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 20717#L178 assume !false; 20716#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20710#L31 assume !(8466 == main_~s__state~0); 20706#L34 assume !(8496 == main_~s__state~0); 20704#L38 assume 8512 == main_~s__state~0; 20651#L39 main_~s__state~0 := 8528; 20660#L178 assume !false; 20658#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20655#L31 assume !(8466 == main_~s__state~0); 20653#L34 assume !(8496 == main_~s__state~0); 20650#L38 assume !(8512 == main_~s__state~0); 20647#L42 assume !(8528 == main_~s__state~0); 20643#L46 assume !(8544 == main_~s__state~0); 20638#L50 assume !(8560 == main_~s__state~0); 20634#L54 assume 8576 == main_~s__state~0; 20569#L55 [2020-10-20 06:46:54,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:54,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1465346930, now seen corresponding path program 1 times [2020-10-20 06:46:54,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:54,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443588146] [2020-10-20 06:46:54,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 06:46:54,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443588146] [2020-10-20 06:46:54,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:54,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:54,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385245625] [2020-10-20 06:46:54,150 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:54,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1544585997, now seen corresponding path program 1 times [2020-10-20 06:46:54,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:54,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454315613] [2020-10-20 06:46:54,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 06:46:54,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454315613] [2020-10-20 06:46:54,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:54,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:54,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633188134] [2020-10-20 06:46:54,178 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:46:54,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:54,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:54,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:54,179 INFO L87 Difference]: Start difference. First operand 829 states and 1068 transitions. cyclomatic complexity: 262 Second operand 3 states. [2020-10-20 06:46:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:54,232 INFO L93 Difference]: Finished difference Result 886 states and 1109 transitions. [2020-10-20 06:46:54,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:54,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 886 states and 1109 transitions. [2020-10-20 06:46:54,240 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 212 [2020-10-20 06:46:54,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 886 states to 851 states and 1068 transitions. [2020-10-20 06:46:54,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2020-10-20 06:46:54,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2020-10-20 06:46:54,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 851 states and 1068 transitions. [2020-10-20 06:46:54,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:54,247 INFO L691 BuchiCegarLoop]: Abstraction has 851 states and 1068 transitions. [2020-10-20 06:46:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states and 1068 transitions. [2020-10-20 06:46:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 836. [2020-10-20 06:46:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2020-10-20 06:46:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1052 transitions. [2020-10-20 06:46:54,260 INFO L714 BuchiCegarLoop]: Abstraction has 836 states and 1052 transitions. [2020-10-20 06:46:54,260 INFO L594 BuchiCegarLoop]: Abstraction has 836 states and 1052 transitions. [2020-10-20 06:46:54,260 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 06:46:54,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 836 states and 1052 transitions. [2020-10-20 06:46:54,264 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 211 [2020-10-20 06:46:54,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:54,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:54,266 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:54,266 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:54,266 INFO L794 eck$LassoCheckResult]: Stem: 22287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 22226#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 22227#L178 assume !false; 22876#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22873#L31 assume 8466 == main_~s__state~0; 22869#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 22870#L80-1 main_~s__state~0 := 8496; 22894#L178 assume !false; 22846#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22826#L31 assume !(8466 == main_~s__state~0); 22825#L34 assume 8496 == main_~s__state~0; 22824#L35 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 22823#L87-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 22822#L178 assume !false; 22820#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22818#L31 assume !(8466 == main_~s__state~0); 22816#L34 assume !(8496 == main_~s__state~0); 22814#L38 assume 8512 == main_~s__state~0; 22812#L39 main_~s__state~0 := 8528; 22811#L178 assume !false; 22809#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22807#L31 assume !(8466 == main_~s__state~0); 22805#L34 assume !(8496 == main_~s__state~0); 22803#L38 assume !(8512 == main_~s__state~0); 22801#L42 assume 8528 == main_~s__state~0; 22798#L43 main_~s__state~0 := 8544; 22796#L178 assume !false; 22794#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22792#L31 assume !(8466 == main_~s__state~0); 22790#L34 assume !(8496 == main_~s__state~0); 22788#L38 assume !(8512 == main_~s__state~0); 22672#L42 assume !(8528 == main_~s__state~0); 22673#L46 assume !(8544 == main_~s__state~0); 22451#L50 assume !(8560 == main_~s__state~0); 22382#L54 assume 8576 == main_~s__state~0; 22292#L55 [2020-10-20 06:46:54,267 INFO L796 eck$LassoCheckResult]: Loop: 22292#L55 main_~tmp___1~0 := main_#t~nondet11;havoc main_#t~nondet11; 22221#L137 assume 2 == main_~tmp___1~0;main_~s__state~0 := 8466; 22222#L178 assume !false; 22473#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22472#L31 assume 8466 == main_~s__state~0; 22380#L32 assume !(0 == main_~blastFlag~0); 22469#L80-1 main_~s__state~0 := 8496; 22467#L178 assume !false; 22465#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22463#L31 assume !(8466 == main_~s__state~0); 22462#L34 assume 8496 == main_~s__state~0; 22378#L35 assume !(1 == main_~blastFlag~0); 22459#L87-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 22457#L178 assume !false; 22455#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22453#L31 assume !(8466 == main_~s__state~0); 22450#L34 assume !(8496 == main_~s__state~0); 22448#L38 assume 8512 == main_~s__state~0; 22373#L39 main_~s__state~0 := 8528; 22442#L178 assume !false; 22439#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22436#L31 assume !(8466 == main_~s__state~0); 22434#L34 assume !(8496 == main_~s__state~0); 22431#L38 assume !(8512 == main_~s__state~0); 22426#L42 assume 8528 == main_~s__state~0; 22368#L43 main_~s__state~0 := 8544; 22388#L178 assume !false; 22383#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22379#L31 assume !(8466 == main_~s__state~0); 22377#L34 assume !(8496 == main_~s__state~0); 22372#L38 assume !(8512 == main_~s__state~0); 22367#L42 assume !(8528 == main_~s__state~0); 22363#L46 assume !(8544 == main_~s__state~0); 22359#L50 assume !(8560 == main_~s__state~0); 22356#L54 assume 8576 == main_~s__state~0; 22292#L55 [2020-10-20 06:46:54,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:54,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1975408204, now seen corresponding path program 1 times [2020-10-20 06:46:54,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:54,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424634299] [2020-10-20 06:46:54,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-10-20 06:46:54,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424634299] [2020-10-20 06:46:54,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:54,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:54,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493279928] [2020-10-20 06:46:54,290 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:54,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:54,291 INFO L82 PathProgramCache]: Analyzing trace with hash -2135132753, now seen corresponding path program 1 times [2020-10-20 06:46:54,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:54,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565252312] [2020-10-20 06:46:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-10-20 06:46:54,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565252312] [2020-10-20 06:46:54,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:54,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:54,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535125266] [2020-10-20 06:46:54,311 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:46:54,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:54,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:54,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:54,311 INFO L87 Difference]: Start difference. First operand 836 states and 1052 transitions. cyclomatic complexity: 236 Second operand 3 states. [2020-10-20 06:46:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:54,416 INFO L93 Difference]: Finished difference Result 878 states and 1072 transitions. [2020-10-20 06:46:54,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:54,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 878 states and 1072 transitions. [2020-10-20 06:46:54,422 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 206 [2020-10-20 06:46:54,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 878 states to 831 states and 1019 transitions. [2020-10-20 06:46:54,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 254 [2020-10-20 06:46:54,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 256 [2020-10-20 06:46:54,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 831 states and 1019 transitions. [2020-10-20 06:46:54,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:54,428 INFO L691 BuchiCegarLoop]: Abstraction has 831 states and 1019 transitions. [2020-10-20 06:46:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states and 1019 transitions. [2020-10-20 06:46:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 808. [2020-10-20 06:46:54,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-10-20 06:46:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 995 transitions. [2020-10-20 06:46:54,442 INFO L714 BuchiCegarLoop]: Abstraction has 808 states and 995 transitions. [2020-10-20 06:46:54,442 INFO L594 BuchiCegarLoop]: Abstraction has 808 states and 995 transitions. [2020-10-20 06:46:54,442 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 06:46:54,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 808 states and 995 transitions. [2020-10-20 06:46:54,446 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 205 [2020-10-20 06:46:54,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:54,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:54,448 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:54,448 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:54,448 INFO L794 eck$LassoCheckResult]: Stem: 24012#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 23950#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 23951#L178 assume !false; 24001#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24551#L31 assume 8466 == main_~s__state~0; 24550#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 24549#L80-1 main_~s__state~0 := 8496; 24547#L178 assume !false; 24545#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24543#L31 assume !(8466 == main_~s__state~0); 24541#L34 assume 8496 == main_~s__state~0; 24540#L35 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 24539#L87-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 24537#L178 assume !false; 24534#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24530#L31 assume !(8466 == main_~s__state~0); 24529#L34 assume !(8496 == main_~s__state~0); 24410#L38 assume 8512 == main_~s__state~0; 24411#L39 main_~s__state~0 := 8528; 24468#L178 assume !false; 24467#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24466#L31 assume !(8466 == main_~s__state~0); 24464#L34 assume !(8496 == main_~s__state~0); 24462#L38 assume !(8512 == main_~s__state~0); 24461#L42 assume 8528 == main_~s__state~0; 24459#L43 main_~s__state~0 := 8544; 24457#L178 assume !false; 24455#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24453#L31 assume !(8466 == main_~s__state~0); 24451#L34 assume !(8496 == main_~s__state~0); 24450#L38 assume !(8512 == main_~s__state~0); 24448#L42 assume !(8528 == main_~s__state~0); 24447#L46 assume 8544 == main_~s__state~0; 24438#L47 assume !(0 != 1 + main_~s__verify_mode~0);main_~s__state~0 := 8560; 24434#L178 assume !false; 24432#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24430#L31 assume !(8466 == main_~s__state~0); 24427#L34 assume !(8496 == main_~s__state~0); 24424#L38 assume !(8512 == main_~s__state~0); 24421#L42 assume !(8528 == main_~s__state~0); 24417#L46 assume !(8544 == main_~s__state~0); 24413#L50 assume !(8560 == main_~s__state~0); 24136#L54 assume 8576 == main_~s__state~0; 24015#L55 [2020-10-20 06:46:54,449 INFO L796 eck$LassoCheckResult]: Loop: 24015#L55 main_~tmp___1~0 := main_#t~nondet11;havoc main_#t~nondet11; 23945#L137 assume 2 == main_~tmp___1~0;main_~s__state~0 := 8466; 23946#L178 assume !false; 24306#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24304#L31 assume 8466 == main_~s__state~0; 24103#L32 assume !(0 == main_~blastFlag~0); 24301#L80-1 main_~s__state~0 := 8496; 24300#L178 assume !false; 24298#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24296#L31 assume !(8466 == main_~s__state~0); 24294#L34 assume 8496 == main_~s__state~0; 24100#L35 assume !(1 == main_~blastFlag~0); 24291#L87-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 24289#L178 assume !false; 24288#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24286#L31 assume !(8466 == main_~s__state~0); 24284#L34 assume !(8496 == main_~s__state~0); 24282#L38 assume 8512 == main_~s__state~0; 24097#L39 main_~s__state~0 := 8528; 24279#L178 assume !false; 24245#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24237#L31 assume !(8466 == main_~s__state~0); 24236#L34 assume !(8496 == main_~s__state~0); 24235#L38 assume !(8512 == main_~s__state~0); 24234#L42 assume 8528 == main_~s__state~0; 24094#L43 main_~s__state~0 := 8544; 24231#L178 assume !false; 24230#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24226#L31 assume !(8466 == main_~s__state~0); 24217#L34 assume !(8496 == main_~s__state~0); 24214#L38 assume !(8512 == main_~s__state~0); 24213#L42 assume !(8528 == main_~s__state~0); 24131#L46 assume 8544 == main_~s__state~0; 24091#L47 assume !(0 != 1 + main_~s__verify_mode~0);main_~s__state~0 := 8560; 24107#L178 assume !false; 24105#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24102#L31 assume !(8466 == main_~s__state~0); 24099#L34 assume !(8496 == main_~s__state~0); 24096#L38 assume !(8512 == main_~s__state~0); 24093#L42 assume !(8528 == main_~s__state~0); 24090#L46 assume !(8544 == main_~s__state~0); 24087#L50 assume !(8560 == main_~s__state~0); 24085#L54 assume 8576 == main_~s__state~0; 24015#L55 [2020-10-20 06:46:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash 242898568, now seen corresponding path program 1 times [2020-10-20 06:46:54,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:54,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67212849] [2020-10-20 06:46:54,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-20 06:46:54,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67212849] [2020-10-20 06:46:54,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:54,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:54,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290585804] [2020-10-20 06:46:54,471 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:54,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:54,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1911359613, now seen corresponding path program 1 times [2020-10-20 06:46:54,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:54,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709682888] [2020-10-20 06:46:54,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-20 06:46:54,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709682888] [2020-10-20 06:46:54,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:54,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:54,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118868053] [2020-10-20 06:46:54,489 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:46:54,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:54,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:54,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:54,490 INFO L87 Difference]: Start difference. First operand 808 states and 995 transitions. cyclomatic complexity: 204 Second operand 3 states. [2020-10-20 06:46:54,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:54,556 INFO L93 Difference]: Finished difference Result 889 states and 1061 transitions. [2020-10-20 06:46:54,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:54,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 889 states and 1061 transitions. [2020-10-20 06:46:54,561 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 182 [2020-10-20 06:46:54,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 889 states to 825 states and 988 transitions. [2020-10-20 06:46:54,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2020-10-20 06:46:54,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2020-10-20 06:46:54,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 825 states and 988 transitions. [2020-10-20 06:46:54,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:54,567 INFO L691 BuchiCegarLoop]: Abstraction has 825 states and 988 transitions. [2020-10-20 06:46:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states and 988 transitions. [2020-10-20 06:46:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 816. [2020-10-20 06:46:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2020-10-20 06:46:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 979 transitions. [2020-10-20 06:46:54,581 INFO L714 BuchiCegarLoop]: Abstraction has 816 states and 979 transitions. [2020-10-20 06:46:54,581 INFO L594 BuchiCegarLoop]: Abstraction has 816 states and 979 transitions. [2020-10-20 06:46:54,581 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-20 06:46:54,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 816 states and 979 transitions. [2020-10-20 06:46:54,584 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 182 [2020-10-20 06:46:54,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:54,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:54,586 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:54,586 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:54,586 INFO L794 eck$LassoCheckResult]: Stem: 25708#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 25651#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 25652#L178 assume !false; 26307#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26308#L31 assume 8466 == main_~s__state~0; 26390#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 26389#L80-1 main_~s__state~0 := 8496; 26388#L178 assume !false; 26387#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26386#L31 assume !(8466 == main_~s__state~0); 26385#L34 assume 8496 == main_~s__state~0; 26383#L35 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 26384#L87-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 26160#L178 assume !false; 26159#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26158#L31 assume !(8466 == main_~s__state~0); 26156#L34 assume !(8496 == main_~s__state~0); 26149#L38 assume !(8512 == main_~s__state~0); 26148#L42 assume !(8528 == main_~s__state~0); 26147#L46 assume !(8544 == main_~s__state~0); 26146#L50 assume !(8560 == main_~s__state~0); 26145#L54 assume !(8576 == main_~s__state~0); 26143#L58 assume !(8592 == main_~s__state~0); 26141#L62 assume !(8608 == main_~s__state~0); 26139#L66 assume !(8640 == main_~s__state~0); 26137#L70 assume 8656 == main_~s__state~0; 26135#L71 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 26134#L164-1 main_~s__state~0 := 8672; 26110#L178 assume !false; 26107#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26106#L31 assume !(8466 == main_~s__state~0); 26098#L34 assume !(8496 == main_~s__state~0); 26099#L38 assume !(8512 == main_~s__state~0); 26090#L42 assume !(8528 == main_~s__state~0); 26091#L46 assume !(8544 == main_~s__state~0); 26083#L50 assume !(8560 == main_~s__state~0); 26084#L54 assume !(8576 == main_~s__state~0); 26075#L58 assume !(8592 == main_~s__state~0); 26076#L62 assume !(8608 == main_~s__state~0); 26071#L66 assume !(8640 == main_~s__state~0); 26072#L70 assume !(8656 == main_~s__state~0); 25657#L74 assume 8672 == main_~s__state~0; 25658#L75 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 25659#L171-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 25660#L178 assume !false; 26133#L25 [2020-10-20 06:46:54,586 INFO L796 eck$LassoCheckResult]: Loop: 26133#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26344#L31 assume !(8466 == main_~s__state~0); 25945#L34 assume !(8496 == main_~s__state~0); 25942#L38 assume !(8512 == main_~s__state~0); 25939#L42 assume !(8528 == main_~s__state~0); 25934#L46 assume !(8544 == main_~s__state~0); 25930#L50 assume !(8560 == main_~s__state~0); 25675#L54 assume !(8576 == main_~s__state~0); 25626#L58 assume !(8592 == main_~s__state~0); 25627#L62 assume !(8608 == main_~s__state~0); 25644#L66 assume !(8640 == main_~s__state~0); 25691#L70 assume 8656 == main_~s__state~0; 25638#L71 assume !(2 == main_~blastFlag~0); 25639#L164-1 main_~s__state~0 := 8672; 25681#L178 assume !false; 26109#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26106#L31 assume !(8466 == main_~s__state~0); 26098#L34 assume !(8496 == main_~s__state~0); 26099#L38 assume !(8512 == main_~s__state~0); 26090#L42 assume !(8528 == main_~s__state~0); 26091#L46 assume !(8544 == main_~s__state~0); 26083#L50 assume !(8560 == main_~s__state~0); 26084#L54 assume !(8576 == main_~s__state~0); 26075#L58 assume !(8592 == main_~s__state~0); 26076#L62 assume !(8608 == main_~s__state~0); 26071#L66 assume !(8640 == main_~s__state~0); 26072#L70 assume !(8656 == main_~s__state~0); 25657#L74 assume 8672 == main_~s__state~0; 25658#L75 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 25659#L171-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 25660#L178 assume !false; 26133#L25 [2020-10-20 06:46:54,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:54,587 INFO L82 PathProgramCache]: Analyzing trace with hash -359758799, now seen corresponding path program 1 times [2020-10-20 06:46:54,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:54,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86557514] [2020-10-20 06:46:54,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 06:46:54,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86557514] [2020-10-20 06:46:54,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:46:54,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:46:54,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231042204] [2020-10-20 06:46:54,609 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:46:54,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:54,610 INFO L82 PathProgramCache]: Analyzing trace with hash 944749696, now seen corresponding path program 1 times [2020-10-20 06:46:54,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:54,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390991566] [2020-10-20 06:46:54,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:54,615 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:54,618 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:54,620 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:54,804 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 20 [2020-10-20 06:46:54,816 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:54,816 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:54,816 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:54,816 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:54,816 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:46:54,817 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:54,817 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:54,817 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:54,817 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration16_Loop [2020-10-20 06:46:54,817 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:54,817 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:54,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:54,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:54,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:54,871 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:54,872 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:54,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:54,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:46:54,888 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:46:54,888 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__hit~0=7} Honda state: {ULTIMATE.start_main_~s__hit~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:54,910 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:46:54,910 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:54,935 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:46:54,935 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:46:54,939 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:46:54,960 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:46:54,960 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:46:54,960 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:46:54,960 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:46:54,960 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:46:54,961 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:54,961 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:46:54,961 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:46:54,961 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration16_Loop [2020-10-20 06:46:54,961 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:46:54,961 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:46:54,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:54,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:54,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:46:55,017 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:46:55,017 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:46:55,023 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-10-20 06:46:55,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:55,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:55,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:55,025 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:46:55,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:55,026 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:46:55,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:55,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:55,055 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-10-20 06:46:55,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:46:55,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:46:55,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:46:55,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:46:55,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:46:55,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:46:55,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:46:55,060 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:46:55,065 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:46:55,065 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:46:55,068 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:46:55,068 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:46:55,068 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:46:55,068 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = 1*ULTIMATE.start_main_~s__state~0 Supporting invariants [] [2020-10-20 06:46:55,088 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:46:55,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:55,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:55,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:55,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:55,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:55,154 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:46:55,154 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 816 states and 979 transitions. cyclomatic complexity: 179 Second operand 5 states. [2020-10-20 06:46:55,165 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 816 states and 979 transitions. cyclomatic complexity: 179. Second operand 5 states. Result 822 states and 985 transitions. Complement of second has 5 states. [2020-10-20 06:46:55,165 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-10-20 06:46:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:46:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-10-20 06:46:55,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 45 letters. Loop has 31 letters. [2020-10-20 06:46:55,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:55,166 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:46:55,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:55,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:55,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:55,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:55,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:55,251 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 06:46:55,251 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 816 states and 979 transitions. cyclomatic complexity: 179 Second operand 5 states. [2020-10-20 06:46:55,259 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 816 states and 979 transitions. cyclomatic complexity: 179. Second operand 5 states. Result 822 states and 985 transitions. Complement of second has 5 states. [2020-10-20 06:46:55,262 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-10-20 06:46:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:46:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-10-20 06:46:55,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 45 letters. Loop has 31 letters. [2020-10-20 06:46:55,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:55,263 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:46:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:55,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:46:55,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:46:55,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:46:55,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:46:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:46:55,327 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 3 loop predicates [2020-10-20 06:46:55,327 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 816 states and 979 transitions. cyclomatic complexity: 179 Second operand 5 states. [2020-10-20 06:46:55,473 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 816 states and 979 transitions. cyclomatic complexity: 179. Second operand 5 states. Result 1762 states and 2064 transitions. Complement of second has 18 states. [2020-10-20 06:46:55,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:46:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:46:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2020-10-20 06:46:55,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 128 transitions. Stem has 45 letters. Loop has 31 letters. [2020-10-20 06:46:55,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:55,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 128 transitions. Stem has 76 letters. Loop has 31 letters. [2020-10-20 06:46:55,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:55,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 128 transitions. Stem has 45 letters. Loop has 62 letters. [2020-10-20 06:46:55,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:46:55,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1762 states and 2064 transitions. [2020-10-20 06:46:55,489 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 146 [2020-10-20 06:46:55,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1762 states to 1036 states and 1214 transitions. [2020-10-20 06:46:55,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 224 [2020-10-20 06:46:55,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2020-10-20 06:46:55,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1036 states and 1214 transitions. [2020-10-20 06:46:55,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:55,497 INFO L691 BuchiCegarLoop]: Abstraction has 1036 states and 1214 transitions. [2020-10-20 06:46:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states and 1214 transitions. [2020-10-20 06:46:55,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 864. [2020-10-20 06:46:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2020-10-20 06:46:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1039 transitions. [2020-10-20 06:46:55,514 INFO L714 BuchiCegarLoop]: Abstraction has 864 states and 1039 transitions. [2020-10-20 06:46:55,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:46:55,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:46:55,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:46:55,515 INFO L87 Difference]: Start difference. First operand 864 states and 1039 transitions. Second operand 3 states. [2020-10-20 06:46:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:46:55,536 INFO L93 Difference]: Finished difference Result 864 states and 1036 transitions. [2020-10-20 06:46:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:46:55,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 864 states and 1036 transitions. [2020-10-20 06:46:55,541 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 146 [2020-10-20 06:46:55,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 864 states to 864 states and 1036 transitions. [2020-10-20 06:46:55,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 227 [2020-10-20 06:46:55,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2020-10-20 06:46:55,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 864 states and 1036 transitions. [2020-10-20 06:46:55,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:46:55,548 INFO L691 BuchiCegarLoop]: Abstraction has 864 states and 1036 transitions. [2020-10-20 06:46:55,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states and 1036 transitions. [2020-10-20 06:46:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2020-10-20 06:46:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2020-10-20 06:46:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1036 transitions. [2020-10-20 06:46:55,565 INFO L714 BuchiCegarLoop]: Abstraction has 864 states and 1036 transitions. [2020-10-20 06:46:55,565 INFO L594 BuchiCegarLoop]: Abstraction has 864 states and 1036 transitions. [2020-10-20 06:46:55,565 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-20 06:46:55,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 864 states and 1036 transitions. [2020-10-20 06:46:55,568 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 146 [2020-10-20 06:46:55,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:46:55,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:46:55,570 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:55,570 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:46:55,571 INFO L794 eck$LassoCheckResult]: Stem: 32390#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 32337#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~s__verify_mode~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~s__session__peer~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 32338#L178 assume !false; 32853#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 32852#L31 assume 8466 == main_~s__state~0; 32851#L32 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 32850#L80-1 main_~s__state~0 := 8496; 32849#L178 assume !false; 32848#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 32847#L31 assume !(8466 == main_~s__state~0); 32846#L34 assume 8496 == main_~s__state~0; 32845#L35 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 32842#L87-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 32841#L178 assume !false; 32839#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 32836#L31 assume !(8466 == main_~s__state~0); 32833#L34 assume !(8496 == main_~s__state~0); 32830#L38 assume 8512 == main_~s__state~0; 32826#L39 main_~s__state~0 := 8528; 32822#L178 assume !false; 32818#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 32813#L31 assume !(8466 == main_~s__state~0); 32812#L34 assume !(8496 == main_~s__state~0); 32811#L38 assume !(8512 == main_~s__state~0); 32809#L42 assume 8528 == main_~s__state~0; 32807#L43 main_~s__state~0 := 8544; 32805#L178 assume !false; 32803#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 32801#L31 assume !(8466 == main_~s__state~0); 32800#L34 assume !(8496 == main_~s__state~0); 32747#L38 assume !(8512 == main_~s__state~0); 32746#L42 assume !(8528 == main_~s__state~0); 32744#L46 assume 8544 == main_~s__state~0; 32737#L47 assume 0 != 1 + main_~s__verify_mode~0; 32738#L107 assume !(0 != main_~s__session__peer~0); 32655#L114 assume !(0 != (256 + main_~s__s3__tmp__new_cipher__algorithms~0) % 4294967296); 32653#L122 main_~s__state~0 := 8576; 32626#L178 assume !false; 32627#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 32621#L31 assume !(8466 == main_~s__state~0); 32619#L34 assume !(8496 == main_~s__state~0); 32617#L38 assume !(8512 == main_~s__state~0); 32615#L42 assume !(8528 == main_~s__state~0); 32589#L46 assume !(8544 == main_~s__state~0); 32590#L50 assume !(8560 == main_~s__state~0); 32487#L54 assume 8576 == main_~s__state~0; 32407#L55 [2020-10-20 06:46:55,571 INFO L796 eck$LassoCheckResult]: Loop: 32407#L55 main_~tmp___1~0 := main_#t~nondet11;havoc main_#t~nondet11; 32332#L137 assume 2 == main_~tmp___1~0;main_~s__state~0 := 8466; 32333#L178 assume !false; 33003#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 33000#L31 assume 8466 == main_~s__state~0; 32345#L32 assume !(0 == main_~blastFlag~0); 32301#L80-1 main_~s__state~0 := 8496; 32302#L178 assume !false; 32955#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 32951#L31 assume !(8466 == main_~s__state~0); 32947#L34 assume 8496 == main_~s__state~0; 32862#L35 assume !(1 == main_~blastFlag~0); 32941#L87-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 32938#L178 assume !false; 32936#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 32934#L31 assume !(8466 == main_~s__state~0); 32932#L34 assume !(8496 == main_~s__state~0); 32930#L38 assume 8512 == main_~s__state~0; 32884#L39 main_~s__state~0 := 8528; 32929#L178 assume !false; 32928#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 32926#L31 assume !(8466 == main_~s__state~0); 32924#L34 assume !(8496 == main_~s__state~0); 32922#L38 assume !(8512 == main_~s__state~0); 32388#L42 assume 8528 == main_~s__state~0; 32347#L43 main_~s__state~0 := 8544; 32348#L178 assume !false; 32913#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 32911#L31 assume !(8466 == main_~s__state~0); 32909#L34 assume !(8496 == main_~s__state~0); 32907#L38 assume !(8512 == main_~s__state~0); 32905#L42 assume !(8528 == main_~s__state~0); 32903#L46 assume 8544 == main_~s__state~0; 32305#L47 assume 0 != 1 + main_~s__verify_mode~0; 32307#L107 assume !(0 != main_~s__session__peer~0); 32351#L114 assume !(0 != (256 + main_~s__s3__tmp__new_cipher__algorithms~0) % 4294967296); 32315#L122 main_~s__state~0 := 8576; 32316#L178 assume !false; 32888#L25 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 32886#L31 assume !(8466 == main_~s__state~0); 32885#L34 assume !(8496 == main_~s__state~0); 32883#L38 assume !(8512 == main_~s__state~0); 32882#L42 assume !(8528 == main_~s__state~0); 32881#L46 assume !(8544 == main_~s__state~0); 32880#L50 assume !(8560 == main_~s__state~0); 32878#L54 assume 8576 == main_~s__state~0; 32407#L55 [2020-10-20 06:46:55,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:55,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1923687841, now seen corresponding path program 1 times [2020-10-20 06:46:55,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:55,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558540691] [2020-10-20 06:46:55,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:55,585 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:55,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:55,608 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:55,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash -180445498, now seen corresponding path program 1 times [2020-10-20 06:46:55,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:55,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130315232] [2020-10-20 06:46:55,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:55,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:55,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:55,623 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:55,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:46:55,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1007086694, now seen corresponding path program 1 times [2020-10-20 06:46:55,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:46:55,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873277166] [2020-10-20 06:46:55,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:46:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:55,636 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:46:55,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:46:55,669 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:46:55,804 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 47 [2020-10-20 06:46:56,238 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 97 [2020-10-20 06:46:56,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:46:56 BoogieIcfgContainer [2020-10-20 06:46:56,363 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:46:56,364 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:46:56,364 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:46:56,364 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:46:56,365 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:46:45" (3/4) ... [2020-10-20 06:46:56,368 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:46:56,430 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:46:56,430 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:46:56,433 INFO L168 Benchmark]: Toolchain (without parser) took 11256.80 ms. Allocated memory was 37.2 MB in the beginning and 117.4 MB in the end (delta: 80.2 MB). Free memory was 19.1 MB in the beginning and 46.6 MB in the end (delta: -27.5 MB). Peak memory consumption was 52.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:46:56,433 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 34.1 MB. Free memory was 10.8 MB in the beginning and 10.8 MB in the end (delta: 47.7 kB). Peak memory consumption was 47.7 kB. Max. memory is 14.3 GB. [2020-10-20 06:46:56,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.61 ms. Allocated memory was 37.2 MB in the beginning and 45.1 MB in the end (delta: 7.9 MB). Free memory was 18.3 MB in the beginning and 26.4 MB in the end (delta: -8.2 MB). Peak memory consumption was 10.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:46:56,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.85 ms. Allocated memory is still 45.1 MB. Free memory was 26.4 MB in the beginning and 24.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:46:56,434 INFO L168 Benchmark]: Boogie Preprocessor took 24.75 ms. Allocated memory is still 45.1 MB. Free memory was 24.7 MB in the beginning and 23.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:46:56,435 INFO L168 Benchmark]: RCFGBuilder took 383.86 ms. Allocated memory was 45.1 MB in the beginning and 46.7 MB in the end (delta: 1.6 MB). Free memory was 23.2 MB in the beginning and 15.9 MB in the end (delta: 7.3 MB). Peak memory consumption was 11.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:46:56,435 INFO L168 Benchmark]: BuchiAutomizer took 10365.13 ms. Allocated memory was 46.7 MB in the beginning and 117.4 MB in the end (delta: 70.8 MB). Free memory was 15.6 MB in the beginning and 51.3 MB in the end (delta: -35.7 MB). Peak memory consumption was 65.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:46:56,436 INFO L168 Benchmark]: Witness Printer took 66.38 ms. Allocated memory is still 117.4 MB. Free memory was 51.3 MB in the beginning and 46.6 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:46:56,438 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.17 ms. Allocated memory is still 34.1 MB. Free memory was 10.8 MB in the beginning and 10.8 MB in the end (delta: 47.7 kB). Peak memory consumption was 47.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 370.61 ms. Allocated memory was 37.2 MB in the beginning and 45.1 MB in the end (delta: 7.9 MB). Free memory was 18.3 MB in the beginning and 26.4 MB in the end (delta: -8.2 MB). Peak memory consumption was 10.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 35.85 ms. Allocated memory is still 45.1 MB. Free memory was 26.4 MB in the beginning and 24.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 24.75 ms. Allocated memory is still 45.1 MB. Free memory was 24.7 MB in the beginning and 23.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 383.86 ms. Allocated memory was 45.1 MB in the beginning and 46.7 MB in the end (delta: 1.6 MB). Free memory was 23.2 MB in the beginning and 15.9 MB in the end (delta: 7.3 MB). Peak memory consumption was 11.5 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 10365.13 ms. Allocated memory was 46.7 MB in the beginning and 117.4 MB in the end (delta: 70.8 MB). Free memory was 15.6 MB in the beginning and 51.3 MB in the end (delta: -35.7 MB). Peak memory consumption was 65.1 MB. Max. memory is 14.3 GB. * Witness Printer took 66.38 ms. Allocated memory is still 117.4 MB. Free memory was 51.3 MB in the beginning and 46.6 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 25 terminating modules (14 trivial, 9 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * s__state + 8481 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8504 and consists of 4 locations. One deterministic module has affine ranking function -1 * s__state + 8520 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8536 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8552 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8568 and consists of 5 locations. One deterministic module has affine ranking function -2 * blastFlag + 5 and consists of 3 locations. One deterministic module has affine ranking function -1 * s__state + 8664 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8584 and consists of 5 locations. One nondeterministic module has affine ranking function s__state and consists of 4 locations. One nondeterministic module has affine ranking function s__state and consists of 5 locations. 14 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 864 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 17 iterations. TraceHistogramMax:6. Analysis of lassos took 5.2s. Construction of modules took 1.8s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 25. Automata minimization 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 22 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 904 states and ocurred in iteration 8. Nontrivial modules had stage [9, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/13 HoareTripleCheckerStatistics: 1825 SDtfs, 1275 SDslu, 935 SDs, 0 SdLazy, 1965 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT3 SILN0 SILU0 SILI3 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp67 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq197 hnf89 smp100 dnf114 smp94 tf113 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 54]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=10893} State at position 1 is {NULL=0, NULL=0, NULL=0, NULL=10895, NULL=0, tmp___1=2, \result=0, NULL=10894, cb=0, NULL=10893, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76b0dd64=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3705fe4d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@474d107d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63221c60=0, s__session__peer=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1389a69d=2, NULL=0, s__hit=0, NULL=10896, buf=0, s__verify_mode=8, blastFlag=2, s__s3__tmp__new_cipher__algorithms=4294967040, s__state=8576} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 54]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L11] int s__state ; [L12] int s__hit = __VERIFIER_nondet_int() ; [L13] int s__verify_mode = __VERIFIER_nondet_int() ; [L14] int s__session__peer = __VERIFIER_nondet_int() ; [L15] unsigned long s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_long() ; [L16] int buf ; [L17] int cb ; [L18] int blastFlag ; [L19] int tmp___1; [L21] s__state = 8466 [L22] blastFlag = 0 [L24] COND TRUE 1 [L25] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L31] COND TRUE s__state == 8466 [L80] COND TRUE blastFlag == 0 [L81] blastFlag = 1 [L83] s__state = 8496 [L24] COND TRUE 1 [L25] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L31] COND FALSE !(s__state == 8466) [L34] COND TRUE s__state == 8496 [L87] COND TRUE blastFlag == 1 [L88] blastFlag = 2 [L90] COND FALSE !(\read(s__hit)) [L93] s__state = 8512 [L24] COND TRUE 1 [L25] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L31] COND FALSE !(s__state == 8466) [L34] COND FALSE !(s__state == 8496) [L38] COND TRUE s__state == 8512 [L98] s__state = 8528 [L24] COND TRUE 1 [L25] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L31] COND FALSE !(s__state == 8466) [L34] COND FALSE !(s__state == 8496) [L38] COND FALSE !(s__state == 8512) [L42] COND TRUE s__state == 8528 [L102] s__state = 8544 [L24] COND TRUE 1 [L25] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L31] COND FALSE !(s__state == 8466) [L34] COND FALSE !(s__state == 8496) [L38] COND FALSE !(s__state == 8512) [L42] COND FALSE !(s__state == 8528) [L46] COND TRUE s__state == 8544 [L106] COND TRUE s__verify_mode + 1 [L107] COND FALSE !(s__session__peer != 0) [L115] COND FALSE !(s__s3__tmp__new_cipher__algorithms + 256UL) [L123] s__state = 8576 [L24] COND TRUE 1 [L25] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L31] COND FALSE !(s__state == 8466) [L34] COND FALSE !(s__state == 8496) [L38] COND FALSE !(s__state == 8512) [L42] COND FALSE !(s__state == 8528) [L46] COND FALSE !(s__state == 8544) [L50] COND FALSE !(s__state == 8560) [L54] COND TRUE s__state == 8576 Loop: [L136] tmp___1 = __VERIFIER_nondet_int() [L137] COND TRUE tmp___1 == 2 [L138] s__state = 8466 [L24] COND TRUE 1 [L25] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L31] COND TRUE s__state == 8466 [L80] COND FALSE !(blastFlag == 0) [L83] s__state = 8496 [L24] COND TRUE 1 [L25] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L31] COND FALSE !(s__state == 8466) [L34] COND TRUE s__state == 8496 [L87] COND FALSE !(blastFlag == 1) [L90] COND FALSE !(\read(s__hit)) [L93] s__state = 8512 [L24] COND TRUE 1 [L25] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L31] COND FALSE !(s__state == 8466) [L34] COND FALSE !(s__state == 8496) [L38] COND TRUE s__state == 8512 [L98] s__state = 8528 [L24] COND TRUE 1 [L25] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L31] COND FALSE !(s__state == 8466) [L34] COND FALSE !(s__state == 8496) [L38] COND FALSE !(s__state == 8512) [L42] COND TRUE s__state == 8528 [L102] s__state = 8544 [L24] COND TRUE 1 [L25] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L31] COND FALSE !(s__state == 8466) [L34] COND FALSE !(s__state == 8496) [L38] COND FALSE !(s__state == 8512) [L42] COND FALSE !(s__state == 8528) [L46] COND TRUE s__state == 8544 [L106] COND TRUE s__verify_mode + 1 [L107] COND FALSE !(s__session__peer != 0) [L115] COND FALSE !(s__s3__tmp__new_cipher__algorithms + 256UL) [L123] s__state = 8576 [L24] COND TRUE 1 [L25] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L31] COND FALSE !(s__state == 8466) [L34] COND FALSE !(s__state == 8496) [L38] COND FALSE !(s__state == 8512) [L42] COND FALSE !(s__state == 8528) [L46] COND FALSE !(s__state == 8544) [L50] COND FALSE !(s__state == 8560) [L54] COND TRUE s__state == 8576 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...