./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i -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 f10d5178d15d886f7ae857469faf20c98bafd5fa ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:25:55,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:25:55,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:25:55,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:25:55,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:25:55,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:25:55,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:25:55,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:25:55,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:25:55,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:25:55,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:25:55,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:25:55,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:25:55,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:25:55,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:25:55,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:25:55,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:25:55,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:25:55,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:25:55,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:25:55,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:25:55,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:25:55,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:25:55,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:25:55,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:25:55,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:25:55,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:25:55,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:25:55,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:25:55,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:25:55,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:25:55,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:25:55,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:25:55,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:25:55,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:25:55,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:25:55,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:25:55,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:25:55,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:25:55,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:25:55,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:25:55,832 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:25:55,863 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:25:55,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:25:55,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:25:55,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:25:55,867 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:25:55,867 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:25:55,867 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:25:55,868 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:25:55,868 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:25:55,868 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:25:55,869 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:25:55,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:25:55,870 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:25:55,871 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:25:55,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:25:55,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:25:55,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:25:55,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:25:55,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:25:55,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:25:55,872 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:25:55,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:25:55,873 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:25:55,873 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:25:55,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:25:55,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:25:55,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:25:55,874 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:25:55,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:25:55,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:25:55,875 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:25:55,876 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:25:55,878 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:25:55,879 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f10d5178d15d886f7ae857469faf20c98bafd5fa [2020-07-29 03:25:56,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:25:56,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:25:56,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:25:56,282 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:25:56,283 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:25:56,283 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i [2020-07-29 03:25:56,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e758c10b/821767dbdb3941ceb16130088756fba2/FLAG1191363b7 [2020-07-29 03:25:56,964 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:25:56,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i [2020-07-29 03:25:56,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e758c10b/821767dbdb3941ceb16130088756fba2/FLAG1191363b7 [2020-07-29 03:25:57,246 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e758c10b/821767dbdb3941ceb16130088756fba2 [2020-07-29 03:25:57,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:25:57,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:25:57,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:57,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:25:57,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:25:57,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:57" (1/1) ... [2020-07-29 03:25:57,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c0337c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:57, skipping insertion in model container [2020-07-29 03:25:57,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:57" (1/1) ... [2020-07-29 03:25:57,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:25:57,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:25:57,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:57,824 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:25:57,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:57,976 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:25:57,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:57 WrapperNode [2020-07-29 03:25:57,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:57,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:57,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:25:57,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:25:57,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:57" (1/1) ... [2020-07-29 03:25:58,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:57" (1/1) ... [2020-07-29 03:25:58,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:58,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:25:58,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:25:58,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:25:58,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:57" (1/1) ... [2020-07-29 03:25:58,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:57" (1/1) ... [2020-07-29 03:25:58,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:57" (1/1) ... [2020-07-29 03:25:58,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:57" (1/1) ... [2020-07-29 03:25:58,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:57" (1/1) ... [2020-07-29 03:25:58,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:57" (1/1) ... [2020-07-29 03:25:58,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:57" (1/1) ... [2020-07-29 03:25:58,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:25:58,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:25:58,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:25:58,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:25:58,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:25:58,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:25:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:25:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:25:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:25:58,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:25:58,508 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:25:58,508 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 03:25:58,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:58 BoogieIcfgContainer [2020-07-29 03:25:58,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:25:58,515 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:25:58,515 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:25:58,519 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:25:58,520 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:58,521 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:25:57" (1/3) ... [2020-07-29 03:25:58,522 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79cd39f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:58, skipping insertion in model container [2020-07-29 03:25:58,522 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:58,522 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:57" (2/3) ... [2020-07-29 03:25:58,523 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79cd39f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:58, skipping insertion in model container [2020-07-29 03:25:58,523 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:58,524 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:58" (3/3) ... [2020-07-29 03:25:58,525 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cmemchr-alloca-2.i [2020-07-29 03:25:58,573 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:25:58,573 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:25:58,573 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:25:58,574 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:25:58,574 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:25:58,574 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:25:58,574 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:25:58,574 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:25:58,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 03:25:58,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:25:58,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:58,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:58,622 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:25:58,623 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:58,623 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:25:58,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 03:25:58,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:25:58,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:58,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:58,628 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:25:58,628 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:58,635 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~n~0, main_~c~0, main_~nondetArea~0.base, main_~nondetArea~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7; 17#L529true assume !(main_~length~0 < 1); 20#L529-2true assume !(main_~n~0 < 1); 14#L532-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 8#L537-3true [2020-07-29 03:25:58,635 INFO L796 eck$LassoCheckResult]: Loop: 8#L537-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~nondetArea~0.base, main_~nondetArea~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 7#L537-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 8#L537-3true [2020-07-29 03:25:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:58,640 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 03:25:58,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:58,650 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320957406] [2020-07-29 03:25:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:58,746 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:58,759 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:58,781 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:58,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-07-29 03:25:58,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:58,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375680690] [2020-07-29 03:25:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:58,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:58,804 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:58,808 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:58,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:58,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-07-29 03:25:58,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:58,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808387160] [2020-07-29 03:25:58,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:58,836 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:58,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:58,859 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:59,073 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-07-29 03:25:59,206 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:59,207 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:59,207 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:59,208 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:59,208 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:59,208 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,209 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:59,209 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:59,210 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cmemchr-alloca-2.i_Iteration1_Lasso [2020-07-29 03:25:59,210 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:59,210 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:59,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:59,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:00,183 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:00,189 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:00,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:00,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:00,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:00,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:00,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:00,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:00,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:00,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:00,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:00,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:00,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:00,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:00,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:00,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:00,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:00,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:00,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:00,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:00,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:00,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:00,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:00,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:00,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:00,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:00,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:00,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:00,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:00,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:00,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:00,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:00,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:00,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:00,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:01,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:01,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:01,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:01,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:01,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:01,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:01,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:01,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:01,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:01,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:01,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:01,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:01,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:01,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:01,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:01,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:01,199 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:01,392 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 03:26:01,392 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:01,407 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:01,412 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:26:01,413 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:01,414 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [1*ULTIMATE.start_main_~nondetArea~0.offset >= 0] [2020-07-29 03:26:01,470 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 03:26:01,480 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~nondetArea~0.base, main_~nondetArea~0.offset + main_~i~0, 1);havoc main_#t~nondet10;" "main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9;" [2020-07-29 03:26:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,496 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:01,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:26:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:01,579 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#unseeded} is VALID [2020-07-29 03:26:01,579 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#unseeded} havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~n~0, main_~c~0, main_~nondetArea~0.base, main_~nondetArea~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7; {28#unseeded} is VALID [2020-07-29 03:26:01,580 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#unseeded} assume !(main_~length~0 < 1); {28#unseeded} is VALID [2020-07-29 03:26:01,581 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#unseeded} assume !(main_~n~0 < 1); {28#unseeded} is VALID [2020-07-29 03:26:01,582 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; {63#(and (>= ULTIMATE.start_main_~nondetArea~0.offset 0) (= ULTIMATE.start_main_~nondetArea~0.base |ULTIMATE.start_main_#t~malloc8.base|) unseeded)} is VALID [2020-07-29 03:26:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,589 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:26:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:01,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:01,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc8.base|))) (>= ULTIMATE.start_main_~nondetArea~0.offset 0) (= ULTIMATE.start_main_~nondetArea~0.base |ULTIMATE.start_main_#t~malloc8.base|))} assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~nondetArea~0.base, main_~nondetArea~0.offset + main_~i~0, 1);havoc main_#t~nondet10; {84#(and (<= 0 ULTIMATE.start_main_~nondetArea~0.offset) (<= (+ ULTIMATE.start_main_~nondetArea~0.offset ULTIMATE.start_main_~i~0 1) (select |#length| ULTIMATE.start_main_~nondetArea~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (+ oldRank0 ULTIMATE.start_main_~i~0)) (= ULTIMATE.start_main_~nondetArea~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:01,631 INFO L280 TraceCheckUtils]: 1: Hoare triple {84#(and (<= 0 ULTIMATE.start_main_~nondetArea~0.offset) (<= (+ ULTIMATE.start_main_~nondetArea~0.offset ULTIMATE.start_main_~i~0 1) (select |#length| ULTIMATE.start_main_~nondetArea~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (+ oldRank0 ULTIMATE.start_main_~i~0)) (= ULTIMATE.start_main_~nondetArea~0.base |ULTIMATE.start_main_#t~malloc8.base|))} main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; {66#(and (>= ULTIMATE.start_main_~nondetArea~0.offset 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc8.base|)))) unseeded) (= ULTIMATE.start_main_~nondetArea~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:01,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:01,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:01,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:01,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,671 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:01,672 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2020-07-29 03:26:01,885 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 39 states and 56 transitions. Complement of second has 8 states. [2020-07-29 03:26:01,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:01,885 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:01,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 03:26:01,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:01,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:01,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:01,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:01,893 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:01,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:01,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:01,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2020-07-29 03:26:01,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:01,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:01,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:01,898 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states. [2020-07-29 03:26:01,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:01,902 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:26:01,902 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:01,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:01,909 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:01,910 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 56 transitions. cyclomatic complexity: 21 [2020-07-29 03:26:01,911 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:26:01,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:01,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:01,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:01,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:01,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:01,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:01,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 39 letters. Loop has 39 letters. [2020-07-29 03:26:01,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 39 letters. [2020-07-29 03:26:01,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 39 letters. Loop has 39 letters. [2020-07-29 03:26:01,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:26:01,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:26:01,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:26:01,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:01,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:01,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:01,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:01,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:01,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:01,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:01,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:01,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:01,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:01,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:01,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:01,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:01,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:01,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:01,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:01,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:01,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:01,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:01,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:01,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:01,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:01,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:01,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:01,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:01,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:01,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:01,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:26:01,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:01,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:01,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:26:01,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:01,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:01,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:01,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:01,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:01,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:26:01,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,945 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-29 03:26:01,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:01,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:01,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:26:01,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:01,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 56 transitions. cyclomatic complexity: 21 [2020-07-29 03:26:01,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:01,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 18 transitions. [2020-07-29 03:26:01,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 03:26:01,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:26:01,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2020-07-29 03:26:01,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:01,994 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-29 03:26:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2020-07-29 03:26:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-29 03:26:02,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:02,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 18 transitions. Second operand 14 states. [2020-07-29 03:26:02,033 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 18 transitions. Second operand 14 states. [2020-07-29 03:26:02,036 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 14 states. [2020-07-29 03:26:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:02,042 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2020-07-29 03:26:02,043 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2020-07-29 03:26:02,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:02,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:02,044 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states and 18 transitions. [2020-07-29 03:26:02,044 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states and 18 transitions. [2020-07-29 03:26:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:02,046 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2020-07-29 03:26:02,046 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2020-07-29 03:26:02,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:02,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:02,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:02,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 03:26:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-07-29 03:26:02,050 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-29 03:26:02,050 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-29 03:26:02,050 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:26:02,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2020-07-29 03:26:02,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:02,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:02,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:02,053 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:02,053 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:02,054 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 147#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~n~0, main_~c~0, main_~nondetArea~0.base, main_~nondetArea~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7; 148#L529 assume !(main_~length~0 < 1); 152#L529-2 assume !(main_~n~0 < 1); 150#L532-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 145#L537-3 assume !(main_~i~0 < main_~n~0); 146#L537-4 cmemchr_#in~s.base, cmemchr_#in~s.offset, cmemchr_#in~c, cmemchr_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~c~0, main_~n~0;havoc cmemchr_#res.base, cmemchr_#res.offset;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset, cmemchr_#t~mem4, cmemchr_#t~pre2, cmemchr_~p~0.base, cmemchr_~p~0.offset, cmemchr_~s.base, cmemchr_~s.offset, cmemchr_~c, cmemchr_~n;cmemchr_~s.base, cmemchr_~s.offset := cmemchr_#in~s.base, cmemchr_#in~s.offset;cmemchr_~c := cmemchr_#in~c;cmemchr_~n := cmemchr_#in~n; 141#L516 assume 0 != cmemchr_~n % 4294967296;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_~s.base, cmemchr_~s.offset; 140#L518-4 [2020-07-29 03:26:02,054 INFO L796 eck$LassoCheckResult]: Loop: 140#L518-4 cmemchr_#t~post3.base, cmemchr_#t~post3.offset := cmemchr_~p~0.base, cmemchr_~p~0.offset;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_#t~post3.base, 1 + cmemchr_#t~post3.offset;call cmemchr_#t~mem4 := read~int(cmemchr_#t~post3.base, cmemchr_#t~post3.offset, 1); 142#L519 assume !(cmemchr_#t~mem4 % 256 == cmemchr_~c % 256);havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset;havoc cmemchr_#t~mem4; 151#L518-1 cmemchr_#t~pre2 := cmemchr_~n - 1;cmemchr_~n := cmemchr_~n - 1; 139#L518-2 assume !!(0 != cmemchr_#t~pre2 % 4294967296);havoc cmemchr_#t~pre2; 140#L518-4 [2020-07-29 03:26:02,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:02,054 INFO L82 PathProgramCache]: Analyzing trace with hash 180430706, now seen corresponding path program 1 times [2020-07-29 03:26:02,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:02,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049804365] [2020-07-29 03:26:02,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:02,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {184#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {184#true} is VALID [2020-07-29 03:26:02,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {184#true} havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~n~0, main_~c~0, main_~nondetArea~0.base, main_~nondetArea~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7; {184#true} is VALID [2020-07-29 03:26:02,139 INFO L280 TraceCheckUtils]: 2: Hoare triple {184#true} assume !(main_~length~0 < 1); {184#true} is VALID [2020-07-29 03:26:02,140 INFO L280 TraceCheckUtils]: 3: Hoare triple {184#true} assume !(main_~n~0 < 1); {186#(<= 1 ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 03:26:02,141 INFO L280 TraceCheckUtils]: 4: Hoare triple {186#(<= 1 ULTIMATE.start_main_~n~0)} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; {187#(and (<= 1 ULTIMATE.start_main_~n~0) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 03:26:02,142 INFO L280 TraceCheckUtils]: 5: Hoare triple {187#(and (<= 1 ULTIMATE.start_main_~n~0) (= 0 ULTIMATE.start_main_~i~0))} assume !(main_~i~0 < main_~n~0); {185#false} is VALID [2020-07-29 03:26:02,142 INFO L280 TraceCheckUtils]: 6: Hoare triple {185#false} cmemchr_#in~s.base, cmemchr_#in~s.offset, cmemchr_#in~c, cmemchr_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~c~0, main_~n~0;havoc cmemchr_#res.base, cmemchr_#res.offset;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset, cmemchr_#t~mem4, cmemchr_#t~pre2, cmemchr_~p~0.base, cmemchr_~p~0.offset, cmemchr_~s.base, cmemchr_~s.offset, cmemchr_~c, cmemchr_~n;cmemchr_~s.base, cmemchr_~s.offset := cmemchr_#in~s.base, cmemchr_#in~s.offset;cmemchr_~c := cmemchr_#in~c;cmemchr_~n := cmemchr_#in~n; {185#false} is VALID [2020-07-29 03:26:02,143 INFO L280 TraceCheckUtils]: 7: Hoare triple {185#false} assume 0 != cmemchr_~n % 4294967296;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_~s.base, cmemchr_~s.offset; {185#false} is VALID [2020-07-29 03:26:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:02,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049804365] [2020-07-29 03:26:02,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:02,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:26:02,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538422251] [2020-07-29 03:26:02,149 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:02,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:02,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2036779, now seen corresponding path program 1 times [2020-07-29 03:26:02,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:02,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572239233] [2020-07-29 03:26:02,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:02,170 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:02,183 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:02,187 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:02,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:02,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:26:02,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:26:02,275 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 03:26:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:02,359 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-07-29 03:26:02,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:26:02,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:02,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:02,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2020-07-29 03:26:02,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:02,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2020-07-29 03:26:02,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:26:02,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:26:02,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2020-07-29 03:26:02,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:02,374 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-07-29 03:26:02,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2020-07-29 03:26:02,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-07-29 03:26:02,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:02,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 18 transitions. Second operand 14 states. [2020-07-29 03:26:02,375 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 18 transitions. Second operand 14 states. [2020-07-29 03:26:02,375 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 14 states. [2020-07-29 03:26:02,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:02,377 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-07-29 03:26:02,377 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2020-07-29 03:26:02,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:02,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:02,377 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states and 18 transitions. [2020-07-29 03:26:02,377 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states and 18 transitions. [2020-07-29 03:26:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:02,379 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-07-29 03:26:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2020-07-29 03:26:02,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:02,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:02,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:02,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 03:26:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-07-29 03:26:02,381 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-29 03:26:02,381 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-29 03:26:02,381 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:26:02,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2020-07-29 03:26:02,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:02,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:02,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:02,382 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:02,382 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:02,382 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 213#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~n~0, main_~c~0, main_~nondetArea~0.base, main_~nondetArea~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7; 214#L529 assume !(main_~length~0 < 1); 218#L529-2 assume !(main_~n~0 < 1); 215#L532-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 211#L537-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~nondetArea~0.base, main_~nondetArea~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 209#L537-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 210#L537-3 assume !(main_~i~0 < main_~n~0); 212#L537-4 cmemchr_#in~s.base, cmemchr_#in~s.offset, cmemchr_#in~c, cmemchr_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~c~0, main_~n~0;havoc cmemchr_#res.base, cmemchr_#res.offset;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset, cmemchr_#t~mem4, cmemchr_#t~pre2, cmemchr_~p~0.base, cmemchr_~p~0.offset, cmemchr_~s.base, cmemchr_~s.offset, cmemchr_~c, cmemchr_~n;cmemchr_~s.base, cmemchr_~s.offset := cmemchr_#in~s.base, cmemchr_#in~s.offset;cmemchr_~c := cmemchr_#in~c;cmemchr_~n := cmemchr_#in~n; 205#L516 assume 0 != cmemchr_~n % 4294967296;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_~s.base, cmemchr_~s.offset; 206#L518-4 [2020-07-29 03:26:02,383 INFO L796 eck$LassoCheckResult]: Loop: 206#L518-4 cmemchr_#t~post3.base, cmemchr_#t~post3.offset := cmemchr_~p~0.base, cmemchr_~p~0.offset;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_#t~post3.base, 1 + cmemchr_#t~post3.offset;call cmemchr_#t~mem4 := read~int(cmemchr_#t~post3.base, cmemchr_#t~post3.offset, 1); 208#L519 assume !(cmemchr_#t~mem4 % 256 == cmemchr_~c % 256);havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset;havoc cmemchr_#t~mem4; 217#L518-1 cmemchr_#t~pre2 := cmemchr_~n - 1;cmemchr_~n := cmemchr_~n - 1; 207#L518-2 assume !!(0 != cmemchr_#t~pre2 % 4294967296);havoc cmemchr_#t~pre2; 206#L518-4 [2020-07-29 03:26:02,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:02,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1596934864, now seen corresponding path program 1 times [2020-07-29 03:26:02,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:02,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150327187] [2020-07-29 03:26:02,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:02,402 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:02,422 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:02,433 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:02,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:02,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2036779, now seen corresponding path program 2 times [2020-07-29 03:26:02,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:02,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193414179] [2020-07-29 03:26:02,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:02,461 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:02,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:02,481 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:02,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:02,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1308516218, now seen corresponding path program 1 times [2020-07-29 03:26:02,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:02,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970977458] [2020-07-29 03:26:02,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:02,542 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkConcatFeasibility(LassoCheck.java:899) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:832) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 03:26:02,547 INFO L168 Benchmark]: Toolchain (without parser) took 5295.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 961.6 MB in the beginning and 1.0 GB in the end (delta: -56.0 MB). Peak memory consumption was 122.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:02,547 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:02,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -108.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:02,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:02,550 INFO L168 Benchmark]: Boogie Preprocessor took 33.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:02,550 INFO L168 Benchmark]: RCFGBuilder took 450.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:02,551 INFO L168 Benchmark]: BuchiAutomizer took 4029.61 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 21.4 MB). Peak memory consumption was 109.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:02,555 INFO L336 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 724.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -108.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 450.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4029.61 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 21.4 MB). Peak memory consumption was 109.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...