./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.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 bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:37:34,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:37:34,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:37:34,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:37:34,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:37:34,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:37:34,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:37:34,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:37:34,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:37:34,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:37:34,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:37:34,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:37:34,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:37:34,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:37:34,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:37:34,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:37:34,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:37:34,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:37:34,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:37:34,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:37:34,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:37:34,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:37:34,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:37:34,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:37:34,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:37:34,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:37:34,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:37:34,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:37:34,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:37:34,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:37:34,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:37:34,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:37:34,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:37:34,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:37:34,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:37:34,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:37:34,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:37:34,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:37:34,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:37:34,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:37:34,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:37:34,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:37:34,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:37:34,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:37:34,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:37:34,306 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:37:34,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:37:34,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:37:34,307 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:37:34,308 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:37:34,308 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:37:34,308 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:37:34,309 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:37:34,309 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:37:34,309 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:37:34,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:37:34,309 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:37:34,309 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:37:34,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:37:34,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:37:34,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:37:34,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:37:34,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:37:34,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:37:34,310 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:37:34,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:37:34,311 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:37:34,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:37:34,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:37:34,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:37:34,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:37:34,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:37:34,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:37:34,313 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:37:34,313 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c [2022-02-21 03:37:34,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:37:34,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:37:34,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:37:34,512 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:37:34,512 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:37:34,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2022-02-21 03:37:34,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2fac6581/2d9c864c26ae4e16bf9c0079aa8c674e/FLAG411ad10c4 [2022-02-21 03:37:34,951 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:37:34,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2022-02-21 03:37:34,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2fac6581/2d9c864c26ae4e16bf9c0079aa8c674e/FLAG411ad10c4 [2022-02-21 03:37:34,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2fac6581/2d9c864c26ae4e16bf9c0079aa8c674e [2022-02-21 03:37:34,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:37:34,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:37:34,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:37:34,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:37:34,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:37:34,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:37:34" (1/1) ... [2022-02-21 03:37:34,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1e67a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:34, skipping insertion in model container [2022-02-21 03:37:34,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:37:34" (1/1) ... [2022-02-21 03:37:34,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:37:34,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:37:35,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2022-02-21 03:37:35,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:37:35,181 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:37:35,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2022-02-21 03:37:35,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:37:35,220 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:37:35,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:35 WrapperNode [2022-02-21 03:37:35,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:37:35,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:37:35,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:37:35,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:37:35,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:35" (1/1) ... [2022-02-21 03:37:35,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:35" (1/1) ... [2022-02-21 03:37:35,252 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-02-21 03:37:35,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:37:35,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:37:35,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:37:35,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:37:35,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:35" (1/1) ... [2022-02-21 03:37:35,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:35" (1/1) ... [2022-02-21 03:37:35,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:35" (1/1) ... [2022-02-21 03:37:35,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:35" (1/1) ... [2022-02-21 03:37:35,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:35" (1/1) ... [2022-02-21 03:37:35,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:35" (1/1) ... [2022-02-21 03:37:35,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:35" (1/1) ... [2022-02-21 03:37:35,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:37:35,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:37:35,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:37:35,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:37:35,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:35" (1/1) ... [2022-02-21 03:37:35,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:35,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:35,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:35,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:37:35,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:37:35,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:37:35,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:37:35,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:37:35,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:37:35,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:37:35,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:37:35,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:37:35,419 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:37:35,420 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:37:35,564 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:37:35,580 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:37:35,580 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:37:35,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:35 BoogieIcfgContainer [2022-02-21 03:37:35,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:37:35,583 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:37:35,583 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:37:35,586 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:37:35,599 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:35,613 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:37:34" (1/3) ... [2022-02-21 03:37:35,614 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12e1bff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:37:35, skipping insertion in model container [2022-02-21 03:37:35,614 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:35,614 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:35" (2/3) ... [2022-02-21 03:37:35,615 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12e1bff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:37:35, skipping insertion in model container [2022-02-21 03:37:35,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:35,615 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:35" (3/3) ... [2022-02-21 03:37:35,616 INFO L388 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2022-02-21 03:37:35,647 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:37:35,647 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:37:35,648 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:37:35,648 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:37:35,648 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:37:35,648 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:37:35,648 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:37:35,648 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:37:35,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:35,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:35,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:35,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:35,682 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:37:35,682 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:37:35,682 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:37:35,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:35,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:35,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:35,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:35,688 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:37:35,688 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:37:35,693 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; 4#L21-3true [2022-02-21 03:37:35,693 INFO L793 eck$LassoCheckResult]: Loop: 4#L21-3true assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 12#L21-2true main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4#L21-3true [2022-02-21 03:37:35,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:35,702 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:37:35,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:35,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519580592] [2022-02-21 03:37:35,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:35,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:35,805 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:35,845 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:35,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:35,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-02-21 03:37:35,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:35,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813869966] [2022-02-21 03:37:35,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:35,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:35,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:35,891 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:35,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:35,893 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 03:37:35,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:35,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800434400] [2022-02-21 03:37:35,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:35,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:35,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:35,943 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:36,290 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:36,290 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:36,291 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:36,291 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:36,291 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:36,291 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:36,291 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:36,291 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:36,292 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration1_Lasso [2022-02-21 03:37:36,292 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:36,292 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:36,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:36,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:36,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:36,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:36,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:36,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:36,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:36,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:36,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:36,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:36,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:36,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:36,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:36,925 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:36,928 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:36,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:36,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:36,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:36,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:36,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:36,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:36,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:36,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:36,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:36,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:36,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:36,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:37:36,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:36,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:37:36,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:36,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:36,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:36,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:37:36,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:36,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:36,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:36,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:36,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:36,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:36,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:36,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:37,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:37,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:37,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:37,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:37,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:37,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:37:37,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:37,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:37,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:37,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:37,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:37,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:37,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:37,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:37,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:37,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:37,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:37,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:37,084 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:37,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:37:37,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:37,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:37,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:37,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:37,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:37,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:37,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:37,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:37,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:37,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:37,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:37,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:37,130 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:37,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:37:37,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:37,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:37,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:37,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:37,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:37,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:37:37,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:37:37,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:37,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:37,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:37,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:37,176 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:37,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:37:37,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:37,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:37,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:37,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:37,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:37,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:37,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:37,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:37,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:37,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:37,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:37,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:37,221 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:37,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:37:37,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:37,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:37,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:37,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:37,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:37,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:37:37,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:37:37,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:37,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:37,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:37,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:37,265 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:37,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:37:37,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:37,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:37,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:37,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:37,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:37,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:37:37,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:37:37,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:37,326 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:37:37,326 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:37:37,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:37,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:37,329 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:37,362 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:37,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:37:37,377 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:37:37,377 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:37,378 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#in~0#1.base)_1) = -2*ULTIMATE.start_main_~i~0#1 + 21*v_rep(select #length ULTIMATE.start_main_~#in~0#1.base)_1 Supporting invariants [] [2022-02-21 03:37:37,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:37,430 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-02-21 03:37:37,433 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1;" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2022-02-21 03:37:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:37,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:37,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:37,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:37,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); {23#unseeded} is VALID [2022-02-21 03:37:37,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {23#unseeded} is VALID [2022-02-21 03:37:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:37,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:37:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:37,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:37,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (* 21 (select |#length| |ULTIMATE.start_main_~#in~0#1.base|))))} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {69#(and (<= 1 (select |#length| |ULTIMATE.start_main_~#in~0#1.base|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (* (select |#length| |ULTIMATE.start_main_~#in~0#1.base|) 21))) (< |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:37,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#(and (<= 1 (select |#length| |ULTIMATE.start_main_~#in~0#1.base|)) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (* (select |#length| |ULTIMATE.start_main_~#in~0#1.base|) 21))) (< |ULTIMATE.start_main_~i~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {61#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) (* 21 (select |#length| |ULTIMATE.start_main_~#in~0#1.base|))))))} is VALID [2022-02-21 03:37:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:37,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:37,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:37,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:37:37,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,622 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 [2022-02-21 03:37:37,623 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,669 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 35 transitions. Complement of second has 8 states. [2022-02-21 03:37:37,669 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 [2022-02-21 03:37:37,669 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:37,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,671 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:37,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:37,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:37,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:37,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:37,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:37,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2022-02-21 03:37:37,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:37:37,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:37,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:37,676 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:37,678 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:37:37,678 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:37,679 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:37:37,679 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 35 transitions. cyclomatic complexity: 13 [2022-02-21 03:37:37,679 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:37,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:37:37,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:37:37,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:37:37,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:37,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:37,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:37,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:37:37,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:37:37,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:37:37,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:37:37,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:37:37,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:37:37,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:37:37,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:37:37,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:37:37,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:37:37,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:37:37,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:37:37,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:37:37,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:37:37,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:37:37,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:37:37,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:37:37,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:37:37,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:37:37,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:37:37,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:37:37,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:37:37,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:37:37,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:37:37,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:37,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:37,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:37,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:37:37,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:37:37,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:37:37,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,690 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-02-21 03:37:37,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:37:37,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:37:37,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:37:37,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:37,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. cyclomatic complexity: 13 [2022-02-21 03:37:37,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:37:37,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 7 states and 9 transitions. [2022-02-21 03:37:37,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2022-02-21 03:37:37,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:37:37,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2022-02-21 03:37:37,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:37,701 INFO L681 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2022-02-21 03:37:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2022-02-21 03:37:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-02-21 03:37:37,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:37,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,718 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,719 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:37,721 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2022-02-21 03:37:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2022-02-21 03:37:37,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:37,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:37,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 7 states and 9 transitions. [2022-02-21 03:37:37,722 INFO L87 Difference]: Start difference. First operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 7 states and 9 transitions. [2022-02-21 03:37:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:37,723 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2022-02-21 03:37:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2022-02-21 03:37:37,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:37,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:37,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:37,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2022-02-21 03:37:37,726 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2022-02-21 03:37:37,726 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2022-02-21 03:37:37,726 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:37:37,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2022-02-21 03:37:37,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:37:37,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:37,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:37,727 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:37:37,728 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:37:37,728 INFO L791 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); 114#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; 109#L21-3 assume !(main_~i~0#1 < 11); 110#L21-4 call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; 115#L28-2 [2022-02-21 03:37:37,728 INFO L793 eck$LassoCheckResult]: Loop: 115#L28-2 assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; 115#L28-2 [2022-02-21 03:37:37,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-02-21 03:37:37,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:37,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155820859] [2022-02-21 03:37:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:37,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:37,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {133#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); {133#true} is VALID [2022-02-21 03:37:37,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {133#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {135#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:37,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 11); {134#false} is VALID [2022-02-21 03:37:37,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {134#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {134#false} is VALID [2022-02-21 03:37:37,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:37,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:37,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155820859] [2022-02-21 03:37:37,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155820859] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:37,768 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:37,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:37:37,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047689193] [2022-02-21 03:37:37,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:37,770 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2022-02-21 03:37:37,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:37,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974731530] [2022-02-21 03:37:37,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:37,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:37,784 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:37,793 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:37,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:37,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:37:37,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:37:37,913 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:37,932 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:37:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:37:37,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:37,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2022-02-21 03:37:37,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:37:37,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2022-02-21 03:37:37,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:37:37,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:37:37,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-02-21 03:37:37,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:37,940 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-02-21 03:37:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-02-21 03:37:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2022-02-21 03:37:37,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:37,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,941 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,941 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:37,942 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:37:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:37:37,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:37,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:37,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 10 transitions. [2022-02-21 03:37:37,943 INFO L87 Difference]: Start difference. First operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 10 transitions. [2022-02-21 03:37:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:37,943 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:37:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:37:37,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:37,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:37,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:37,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-02-21 03:37:37,944 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:37:37,944 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:37:37,945 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:37:37,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-02-21 03:37:37,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:37:37,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:37,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:37,945 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:37:37,945 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:37:37,946 INFO L791 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; 147#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 148#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 149#L21-3 assume !(main_~i~0#1 < 11); 150#L21-4 call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; 153#L28-2 [2022-02-21 03:37:37,946 INFO L793 eck$LassoCheckResult]: Loop: 153#L28-2 assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; 153#L28-2 [2022-02-21 03:37:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:37,946 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-02-21 03:37:37,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:37,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857274987] [2022-02-21 03:37:37,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:37,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:37,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); {175#true} is VALID [2022-02-21 03:37:37,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {177#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:37,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {177#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:37,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {178#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:37,980 INFO L290 TraceCheckUtils]: 4: Hoare triple {178#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 11); {176#false} is VALID [2022-02-21 03:37:37,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {176#false} is VALID [2022-02-21 03:37:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:37,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:37,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857274987] [2022-02-21 03:37:37,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857274987] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:37:37,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906495416] [2022-02-21 03:37:37,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:37,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:37:37,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:37,992 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:37:38,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:37:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:38,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:37:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:38,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:38,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); {175#true} is VALID [2022-02-21 03:37:38,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {185#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:38,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {185#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:38,058 INFO L290 TraceCheckUtils]: 3: Hoare triple {185#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {178#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:38,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {178#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 11); {176#false} is VALID [2022-02-21 03:37:38,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {176#false} is VALID [2022-02-21 03:37:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:38,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:37:38,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {176#false} is VALID [2022-02-21 03:37:38,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {201#(< |ULTIMATE.start_main_~i~0#1| 11)} assume !(main_~i~0#1 < 11); {176#false} is VALID [2022-02-21 03:37:38,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {205#(< |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {201#(< |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:38,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {205#(< |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {205#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:38,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {205#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:38,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); {175#true} is VALID [2022-02-21 03:37:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:38,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906495416] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:37:38,099 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:37:38,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:37:38,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040919398] [2022-02-21 03:37:38,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:37:38,099 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:38,100 INFO L85 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2022-02-21 03:37:38,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:38,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055887446] [2022-02-21 03:37:38,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:38,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:38,109 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:38,115 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:38,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:38,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:37:38,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:37:38,214 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:38,261 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-21 03:37:38,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:37:38,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:38,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:38,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2022-02-21 03:37:38,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:37:38,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2022-02-21 03:37:38,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:37:38,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:37:38,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2022-02-21 03:37:38,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:38,274 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-02-21 03:37:38,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2022-02-21 03:37:38,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2022-02-21 03:37:38,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:38,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 16 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:38,275 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 16 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:38,275 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:38,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:38,276 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-21 03:37:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-21 03:37:38,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:38,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:38,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 16 transitions. [2022-02-21 03:37:38,277 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 16 transitions. [2022-02-21 03:37:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:38,277 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-21 03:37:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-21 03:37:38,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:38,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:38,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:38,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-02-21 03:37:38,278 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-02-21 03:37:38,278 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-02-21 03:37:38,278 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:37:38,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2022-02-21 03:37:38,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:37:38,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:38,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:38,279 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-02-21 03:37:38,279 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:37:38,279 INFO L791 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); 234#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; 229#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 230#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 231#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 232#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 241#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 240#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 239#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 238#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 237#L21-3 assume !(main_~i~0#1 < 11); 235#L21-4 call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; 236#L28-2 [2022-02-21 03:37:38,279 INFO L793 eck$LassoCheckResult]: Loop: 236#L28-2 assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; 236#L28-2 [2022-02-21 03:37:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2022-02-21 03:37:38,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:38,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167424287] [2022-02-21 03:37:38,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:38,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:38,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); {275#true} is VALID [2022-02-21 03:37:38,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {277#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:38,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {277#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:38,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {277#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {278#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:38,337 INFO L290 TraceCheckUtils]: 4: Hoare triple {278#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {278#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:38,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {278#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {279#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:38,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {279#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {279#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:38,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {279#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {280#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:38,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {280#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {280#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:38,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {280#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {281#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:38,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {281#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 11); {276#false} is VALID [2022-02-21 03:37:38,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {276#false} is VALID [2022-02-21 03:37:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:38,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:38,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167424287] [2022-02-21 03:37:38,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167424287] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:37:38,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680436532] [2022-02-21 03:37:38,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:37:38,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:37:38,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:38,355 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:37:38,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:37:38,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:37:38,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:37:38,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:37:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:38,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:38,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); {275#true} is VALID [2022-02-21 03:37:38,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {288#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:38,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {288#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:38,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {288#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {278#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:38,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {278#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {278#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:38,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {278#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {279#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:38,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {279#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {279#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:38,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {279#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {280#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:38,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {280#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {280#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:38,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {280#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {281#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:38,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {281#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 11); {276#false} is VALID [2022-02-21 03:37:38,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {276#false} is VALID [2022-02-21 03:37:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:38,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:37:38,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {276#false} is VALID [2022-02-21 03:37:38,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {322#(< |ULTIMATE.start_main_~i~0#1| 11)} assume !(main_~i~0#1 < 11); {276#false} is VALID [2022-02-21 03:37:38,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {326#(< |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {322#(< |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:38,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {326#(< |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {326#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:38,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {333#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {326#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:38,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {333#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {333#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:38,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {333#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:38,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {340#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {340#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:38,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {347#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {340#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:38,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {347#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:38,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {347#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:38,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); {275#true} is VALID [2022-02-21 03:37:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:38,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680436532] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:37:38,625 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:37:38,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-21 03:37:38,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466850717] [2022-02-21 03:37:38,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:37:38,626 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:38,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:38,626 INFO L85 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2022-02-21 03:37:38,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:38,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789069045] [2022-02-21 03:37:38,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:38,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:38,634 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:38,639 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:38,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:38,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:37:38,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:37:38,733 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:38,836 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-21 03:37:38,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:37:38,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:38,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:38,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2022-02-21 03:37:38,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:37:38,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2022-02-21 03:37:38,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:37:38,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:37:38,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2022-02-21 03:37:38,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:38,861 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-02-21 03:37:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2022-02-21 03:37:38,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-02-21 03:37:38,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:38,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 28 transitions. Second operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:38,863 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 28 transitions. Second operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:38,863 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:38,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:38,864 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-21 03:37:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-21 03:37:38,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:38,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:38,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states and 28 transitions. [2022-02-21 03:37:38,865 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states and 28 transitions. [2022-02-21 03:37:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:38,866 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-21 03:37:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-21 03:37:38,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:38,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:38,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:38,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-02-21 03:37:38,869 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-02-21 03:37:38,869 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-02-21 03:37:38,869 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:37:38,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2022-02-21 03:37:38,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:37:38,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:38,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:38,870 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2022-02-21 03:37:38,870 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:37:38,871 INFO L791 eck$LassoCheckResult]: Stem: 387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); 388#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; 383#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 384#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 385#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 386#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 407#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 406#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 405#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 404#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 403#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 402#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 401#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 400#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 399#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 398#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 397#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 396#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 395#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 394#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 393#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 392#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 391#L21-3 assume !(main_~i~0#1 < 11); 389#L21-4 call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; 390#L28-2 [2022-02-21 03:37:38,871 INFO L793 eck$LassoCheckResult]: Loop: 390#L28-2 assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; 390#L28-2 [2022-02-21 03:37:38,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2022-02-21 03:37:38,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:38,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536796749] [2022-02-21 03:37:38,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:38,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:39,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {465#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); {465#true} is VALID [2022-02-21 03:37:39,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {467#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:39,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {467#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {467#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:39,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {467#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {468#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:39,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {468#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {468#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:39,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {469#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:39,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {469#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:39,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {470#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:39,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {470#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {470#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:39,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {471#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:39,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {471#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {471#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:39,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {472#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:39,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {472#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:39,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {473#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:39,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {473#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {473#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:39,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {473#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {474#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:39,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {474#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:39,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {474#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {475#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:39,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {475#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {475#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:39,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {475#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {476#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:39,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {476#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {476#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:39,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {476#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {477#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:39,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {477#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 11); {466#false} is VALID [2022-02-21 03:37:39,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {466#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {466#false} is VALID [2022-02-21 03:37:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:39,018 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:39,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536796749] [2022-02-21 03:37:39,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536796749] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:37:39,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478904886] [2022-02-21 03:37:39,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:37:39,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:37:39,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:39,021 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:37:39,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:37:39,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:37:39,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:37:39,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:37:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:39,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:39,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {465#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); {465#true} is VALID [2022-02-21 03:37:39,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {484#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:39,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {484#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:39,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {484#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {468#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:39,300 INFO L290 TraceCheckUtils]: 4: Hoare triple {468#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {468#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:39,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {469#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:39,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {469#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:39,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {470#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:39,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {470#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {470#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:39,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {471#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:39,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {471#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {471#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:39,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {472#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:39,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {472#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:39,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {473#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:39,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {473#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {473#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:39,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {473#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {474#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:39,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {474#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:39,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {474#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {475#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:39,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {475#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {475#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:39,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {475#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {476#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:39,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {476#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {476#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:39,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {476#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {477#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:39,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {477#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 11); {466#false} is VALID [2022-02-21 03:37:39,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {466#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {466#false} is VALID [2022-02-21 03:37:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:39,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:37:39,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {466#false} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {466#false} is VALID [2022-02-21 03:37:39,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {477#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 11); {466#false} is VALID [2022-02-21 03:37:39,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {476#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {477#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:39,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {476#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {476#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:39,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {475#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {476#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:39,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {475#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {475#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:39,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {474#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {475#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:39,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {474#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:39,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {473#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {474#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:39,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {473#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {473#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:39,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {473#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:39,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {472#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:39,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {472#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:39,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {471#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {471#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:39,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {471#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:39,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {470#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {470#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:39,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {470#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:39,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {469#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:39,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {469#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:39,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {468#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {468#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:39,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {484#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {468#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:39,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {484#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:39,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {484#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:39,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {465#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); {465#true} is VALID [2022-02-21 03:37:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:39,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478904886] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:37:39,501 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:37:39,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 14 [2022-02-21 03:37:39,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703643701] [2022-02-21 03:37:39,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:37:39,501 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:39,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:39,501 INFO L85 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2022-02-21 03:37:39,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:39,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203108691] [2022-02-21 03:37:39,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:39,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:39,512 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:39,517 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:39,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:39,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:37:39,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:37:39,615 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:39,685 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-02-21 03:37:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:37:39,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:39,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:39,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2022-02-21 03:37:39,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:37:39,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2022-02-21 03:37:39,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:37:39,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:37:39,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2022-02-21 03:37:39,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:39,706 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-02-21 03:37:39,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2022-02-21 03:37:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-02-21 03:37:39,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:39,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 30 transitions. Second operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:39,707 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 30 transitions. Second operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:39,707 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:39,708 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-02-21 03:37:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-02-21 03:37:39,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:39,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:39,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states and 30 transitions. [2022-02-21 03:37:39,708 INFO L87 Difference]: Start difference. First operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states and 30 transitions. [2022-02-21 03:37:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:39,709 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-02-21 03:37:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-02-21 03:37:39,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:39,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:39,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:39,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-02-21 03:37:39,710 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-02-21 03:37:39,710 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-02-21 03:37:39,710 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:37:39,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2022-02-21 03:37:39,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:37:39,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:39,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:39,716 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2022-02-21 03:37:39,716 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:37:39,716 INFO L791 eck$LassoCheckResult]: Stem: 652#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); 653#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; 648#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 649#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 650#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 651#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 674#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 673#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 672#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 671#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 670#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 669#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 668#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 667#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 666#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 665#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 664#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 663#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 662#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 661#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 660#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 659#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 658#L21-3 assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 657#L21-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 656#L21-3 assume !(main_~i~0#1 < 11); 654#L21-4 call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; 655#L28-2 [2022-02-21 03:37:39,717 INFO L793 eck$LassoCheckResult]: Loop: 655#L28-2 assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; 655#L28-2 [2022-02-21 03:37:39,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:39,717 INFO L85 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 4 times [2022-02-21 03:37:39,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:39,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394519175] [2022-02-21 03:37:39,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:39,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:39,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:39,798 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:39,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:39,799 INFO L85 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2022-02-21 03:37:39,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:39,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145131335] [2022-02-21 03:37:39,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:39,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:39,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:39,811 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:39,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:39,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2022-02-21 03:37:39,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:39,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365867352] [2022-02-21 03:37:39,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:39,854 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:39,876 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:49,549 WARN L228 SmtUtils]: Spent 9.57s on a formula simplification. DAG size of input: 238 DAG size of output: 185 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-02-21 03:37:51,028 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:51,028 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:51,028 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:51,028 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:51,028 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:51,028 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:51,029 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:51,029 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:51,029 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration6_Lasso [2022-02-21 03:37:51,029 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:51,029 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:51,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:51,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:51,990 WARN L259 bleTransFormulaUtils]: 12 quantified variables [2022-02-21 03:37:51,992 WARN L259 bleTransFormulaUtils]: 3 quantified variables [2022-02-21 03:37:52,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:52,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:52,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:52,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:52,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:52,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:52,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:52,645 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:52,645 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:52,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:52,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:52,652 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:52,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:37:52,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:52,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:52,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:52,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:52,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:52,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:52,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:52,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:52,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:52,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:52,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:52,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:52,696 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:52,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:37:52,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:52,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:52,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:52,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:52,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:52,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:37:52,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:37:52,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:52,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:37:52,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:52,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:52,770 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:52,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:37:52,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:52,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:52,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:52,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:52,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:52,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:37:52,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:37:52,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:52,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:52,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:52,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:52,828 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:52,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:37:52,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:52,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:52,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:52,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:52,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:52,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:37:52,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:37:52,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:52,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:52,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:52,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:52,874 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:52,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:37:52,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:52,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:52,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:52,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:52,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:52,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:37:52,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:37:52,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:52,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:37:52,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:52,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:52,936 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:52,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:52,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:52,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:52,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:52,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:52,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:37:52,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:37:52,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:37:52,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:52,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 03:37:52,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:52,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:52,978 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:52,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:52,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:52,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:52,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:52,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:52,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:37:52,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:37:52,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:37:53,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:53,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:53,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:53,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:53,022 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:53,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:37:53,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:53,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:53,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:53,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:53,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:53,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:37:53,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:37:53,055 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:53,118 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 03:37:53,118 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-02-21 03:37:53,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:53,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:53,171 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:53,175 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:53,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:37:53,197 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:37:53,197 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:53,197 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~idx_in~0#1, v_rep(select #length ULTIMATE.start_main_~#in~0#1.base)_2) = -1*ULTIMATE.start_main_~idx_in~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#in~0#1.base)_2 Supporting invariants [] [2022-02-21 03:37:53,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 03:37:53,300 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2022-02-21 03:37:53,306 INFO L390 LassoCheck]: Loop: "assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;" [2022-02-21 03:37:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:53,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:53,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:53,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {742#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3); {742#unseeded} is VALID [2022-02-21 03:37:53,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {742#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,582 INFO L290 TraceCheckUtils]: 4: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} assume !!(main_~i~0#1 < 11);call write~int(main_#t~nondet5#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} assume !(main_~i~0#1 < 11); {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} call write~int(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1; {826#(and unseeded (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:53,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:37:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:53,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:53,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {827#(and (= |ULTIMATE.start_main_~#in~0#1.offset| 0) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~#in~0#1.base|) (* (- 1) |ULTIMATE.start_main_~idx_in~0#1|))))} assume !!(48 <= main_~c~0#1 % 256 && main_~c~0#1 % 256 <= 57);main_~j~0#1 := main_~c~0#1 % 256 - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1; {829#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~#in~0#1.base|) (* (- 1) |ULTIMATE.start_main_~idx_in~0#1|)))) unseeded) (= |ULTIMATE.start_main_~#in~0#1.offset| 0))} is VALID [2022-02-21 03:37:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:53,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:53,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:53,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 1 letters. [2022-02-21 03:37:53,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,636 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2022-02-21 03:37:53,637 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:53,715 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 29 transitions. Complement of second has 3 states. [2022-02-21 03:37:53,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:53,715 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:53,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. cyclomatic complexity: 3 [2022-02-21 03:37:53,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:53,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:53,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:53,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:37:53,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:53,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:53,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 29 transitions. [2022-02-21 03:37:53,716 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:53,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:53,717 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 28 transitions. cyclomatic complexity: 3 [2022-02-21 03:37:53,717 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:53,717 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:53,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:37:53,717 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:53,717 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 29 transitions. cyclomatic complexity: 3 [2022-02-21 03:37:53,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 29 transitions. cyclomatic complexity: 3 [2022-02-21 03:37:53,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:53,717 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:37:53,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 28 transitions. cyclomatic complexity: 3 Stem has 26 letters. Loop has 1 letters. [2022-02-21 03:37:53,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 1 letters. [2022-02-21 03:37:53,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 29 transitions. cyclomatic complexity: 3 Stem has 26 letters. Loop has 1 letters. [2022-02-21 03:37:53,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 28 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:37:53,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:37:53,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 29 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:37:53,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 28 transitions. cyclomatic complexity: 3 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:37:53,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:37:53,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 29 transitions. cyclomatic complexity: 3 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:37:53,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 28 transitions. cyclomatic complexity: 3 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:37:53,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:37:53,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 29 transitions. cyclomatic complexity: 3 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:37:53,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 28 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:53,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:53,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 29 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:53,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 28 transitions. cyclomatic complexity: 3 Stem has 26 letters. Loop has 1 letters. [2022-02-21 03:37:53,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 1 letters. [2022-02-21 03:37:53,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 29 transitions. cyclomatic complexity: 3 Stem has 26 letters. Loop has 1 letters. [2022-02-21 03:37:53,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 28 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:37:53,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:37:53,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 29 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:37:53,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,720 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:37:53,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 26 letters. Loop has 1 letters. [2022-02-21 03:37:53,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 27 letters. Loop has 1 letters. [2022-02-21 03:37:53,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2022-02-21 03:37:53,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:53,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. cyclomatic complexity: 3 [2022-02-21 03:37:53,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:53,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2022-02-21 03:37:53,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:37:53,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:37:53,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:37:53,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:53,722 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:53,722 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:53,722 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:53,722 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:37:53,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:37:53,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:53,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:53,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:37:53 BoogieIcfgContainer [2022-02-21 03:37:53,732 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:37:53,732 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:37:53,732 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:37:53,732 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:37:53,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:35" (3/4) ... [2022-02-21 03:37:53,734 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:37:53,734 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:37:53,735 INFO L158 Benchmark]: Toolchain (without parser) took 18760.65ms. Allocated memory was 94.4MB in the beginning and 182.5MB in the end (delta: 88.1MB). Free memory was 60.9MB in the beginning and 95.5MB in the end (delta: -34.6MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2022-02-21 03:37:53,736 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 65.4MB in the beginning and 65.4MB in the end (delta: 26.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:53,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.01ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 70.3MB in the end (delta: -9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:37:53,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.05ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 68.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:53,738 INFO L158 Benchmark]: Boogie Preprocessor took 33.08ms. Allocated memory is still 94.4MB. Free memory was 68.6MB in the beginning and 67.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:37:53,738 INFO L158 Benchmark]: RCFGBuilder took 295.26ms. Allocated memory is still 94.4MB. Free memory was 67.5MB in the beginning and 55.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:37:53,738 INFO L158 Benchmark]: BuchiAutomizer took 18148.56ms. Allocated memory was 94.4MB in the beginning and 182.5MB in the end (delta: 88.1MB). Free memory was 55.7MB in the beginning and 95.5MB in the end (delta: -39.8MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2022-02-21 03:37:53,738 INFO L158 Benchmark]: Witness Printer took 2.38ms. Allocated memory is still 182.5MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:53,742 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 65.4MB in the beginning and 65.4MB in the end (delta: 26.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.01ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 70.3MB in the end (delta: -9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.05ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 68.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.08ms. Allocated memory is still 94.4MB. Free memory was 68.6MB in the beginning and 67.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 295.26ms. Allocated memory is still 94.4MB. Free memory was 67.5MB in the beginning and 55.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 18148.56ms. Allocated memory was 94.4MB in the beginning and 182.5MB in the end (delta: 88.1MB). Free memory was 55.7MB in the beginning and 95.5MB in the end (delta: -39.8MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * Witness Printer took 2.38ms. Allocated memory is still 182.5MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 21 * unknown-#length-unknown[in] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[in] + -1 * idx_in and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.0s and 7 iterations. TraceHistogramMax:11. Analysis of lassos took 16.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 22 mSDtfsCounter, 101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital205 mio100 ax100 hnf100 lsp100 ukn71 mio100 lsp36 div137 bol100 ite100 ukn100 eq159 hnf93 smp79 dnf161 smp83 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:37:53,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:53,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:54,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:54,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:54,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE